./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race-2.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race-2.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93fcc6043461d76c9e3fa969bb797afe31775f06278c2c03325428159ee692d6
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 01:25:01,920 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 01:25:01,960 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-12 01:25:01,964 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 01:25:01,964 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 01:25:01,982 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 01:25:01,983 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 01:25:01,983 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 01:25:01,983 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 01:25:01,983 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 01:25:01,984 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 01:25:01,984 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 01:25:01,984 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 01:25:01,985 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 01:25:01,985 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 01:25:01,985 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 01:25:01,985 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 01:25:01,986 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 01:25:01,986 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 01:25:01,986 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 01:25:01,986 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 01:25:01,987 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 01:25:01,987 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 01:25:01,987 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 01:25:01,987 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 01:25:01,988 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 01:25:01,988 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 01:25:01,988 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 01:25:01,988 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 01:25:01,988 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 01:25:01,989 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:25:01,989 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 01:25:01,989 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 01:25:01,989 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 01:25:01,990 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 01:25:01,990 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 01:25:01,990 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 01:25:01,990 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 01:25:01,990 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 01:25:01,991 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 01:25:01,991 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 01:25:01,993 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93fcc6043461d76c9e3fa969bb797afe31775f06278c2c03325428159ee692d6
[2024-03-12 01:25:02,151 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 01:25:02,175 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 01:25:02,179 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 01:25:02,181 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 01:25:02,182 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 01:25:02,183 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race-2.i
[2024-03-12 01:25:03,351 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 01:25:03,517 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 01:25:03,518 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race-2.i
[2024-03-12 01:25:03,532 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/e89b62a15/a3904ab225a5441f8b243fd49c3e4ba7/FLAG34e06063e
[2024-03-12 01:25:03,903 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/e89b62a15/a3904ab225a5441f8b243fd49c3e4ba7
[2024-03-12 01:25:03,905 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 01:25:03,906 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 01:25:03,907 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 01:25:03,907 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 01:25:03,912 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 01:25:03,912 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:25:03" (1/1) ...
[2024-03-12 01:25:03,913 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116c8d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:03, skipping insertion in model container
[2024-03-12 01:25:03,913 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:25:03" (1/1) ...
[2024-03-12 01:25:03,950 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 01:25:04,164 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:25:04,174 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 01:25:04,211 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:25:04,235 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 01:25:04,235 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04 WrapperNode
[2024-03-12 01:25:04,235 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 01:25:04,236 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 01:25:04,236 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 01:25:04,237 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 01:25:04,242 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04" (1/1) ...
[2024-03-12 01:25:04,255 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04" (1/1) ...
[2024-03-12 01:25:04,276 INFO  L138                Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52
[2024-03-12 01:25:04,276 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 01:25:04,277 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 01:25:04,277 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 01:25:04,277 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 01:25:04,285 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04" (1/1) ...
[2024-03-12 01:25:04,285 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04" (1/1) ...
[2024-03-12 01:25:04,287 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04" (1/1) ...
[2024-03-12 01:25:04,287 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04" (1/1) ...
[2024-03-12 01:25:04,293 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04" (1/1) ...
[2024-03-12 01:25:04,295 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04" (1/1) ...
[2024-03-12 01:25:04,296 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04" (1/1) ...
[2024-03-12 01:25:04,297 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04" (1/1) ...
[2024-03-12 01:25:04,299 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 01:25:04,299 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 01:25:04,299 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 01:25:04,299 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 01:25:04,300 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04" (1/1) ...
[2024-03-12 01:25:04,304 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:25:04,313 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:25:04,323 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-12 01:25:04,326 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-12 01:25:04,356 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 01:25:04,357 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 01:25:04,357 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-12 01:25:04,357 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-12 01:25:04,357 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-12 01:25:04,357 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 01:25:04,358 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-12 01:25:04,358 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 01:25:04,358 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 01:25:04,358 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-03-12 01:25:04,358 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 01:25:04,359 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 01:25:04,360 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-12 01:25:04,504 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 01:25:04,505 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 01:25:04,630 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 01:25:04,643 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 01:25:04,644 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 01:25:04,645 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:25:04 BoogieIcfgContainer
[2024-03-12 01:25:04,645 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 01:25:04,647 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 01:25:04,647 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 01:25:04,649 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 01:25:04,649 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 01:25:03" (1/3) ...
[2024-03-12 01:25:04,650 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd51788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:25:04, skipping insertion in model container
[2024-03-12 01:25:04,650 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:25:04" (2/3) ...
[2024-03-12 01:25:04,650 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd51788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:25:04, skipping insertion in model container
[2024-03-12 01:25:04,650 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:25:04" (3/3) ...
[2024-03-12 01:25:04,651 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-2.i
[2024-03-12 01:25:04,657 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 01:25:04,665 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 01:25:04,665 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-03-12 01:25:04,665 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 01:25:04,702 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-12 01:25:04,727 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 69 places, 69 transitions, 145 flow
[2024-03-12 01:25:04,761 INFO  L124   PetriNetUnfolderBase]: 5/97 cut-off events.
[2024-03-12 01:25:04,761 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 01:25:04,765 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 102 conditions, 97 events. 5/97 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 201 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. 
[2024-03-12 01:25:04,765 INFO  L82        GeneralOperation]: Start removeDead. Operand has 69 places, 69 transitions, 145 flow
[2024-03-12 01:25:04,768 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 69 places, 69 transitions, 145 flow
[2024-03-12 01:25:04,776 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:25:04,782 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b83c58f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:25:04,782 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-03-12 01:25:04,790 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:25:04,790 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-03-12 01:25:04,790 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:25:04,791 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:04,791 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:04,792 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-12 01:25:04,795 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:04,796 INFO  L85        PathProgramCache]: Analyzing trace with hash -971135105, now seen corresponding path program 1 times
[2024-03-12 01:25:04,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:04,803 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336207756]
[2024-03-12 01:25:04,803 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:04,804 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:04,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:05,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:05,015 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:05,015 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336207756]
[2024-03-12 01:25:05,015 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336207756] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:05,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:05,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:25:05,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131180672]
[2024-03-12 01:25:05,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:05,024 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:25:05,028 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:05,045 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:25:05,045 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:25:05,074 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 69
[2024-03-12 01:25:05,076 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 145 flow. Second operand  has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,076 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:05,076 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 69
[2024-03-12 01:25:05,077 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:05,125 INFO  L124   PetriNetUnfolderBase]: 8/156 cut-off events.
[2024-03-12 01:25:05,125 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 01:25:05,126 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 190 conditions, 156 events. 8/156 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 433 event pairs, 0 based on Foata normal form. 5/145 useless extension candidates. Maximal degree in co-relation 133. Up to 17 conditions per place. 
[2024-03-12 01:25:05,127 INFO  L140   encePairwiseOnDemand]: 62/69 looper letters, 10 selfloop transitions, 4 changer transitions 1/71 dead transitions.
[2024-03-12 01:25:05,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 71 transitions, 179 flow
[2024-03-12 01:25:05,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:25:05,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:25:05,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions.
[2024-03-12 01:25:05,137 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8804347826086957
[2024-03-12 01:25:05,138 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 243 transitions.
[2024-03-12 01:25:05,138 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 243 transitions.
[2024-03-12 01:25:05,139 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:05,141 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 243 transitions.
[2024-03-12 01:25:05,143 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,146 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,146 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,147 INFO  L175             Difference]: Start difference. First operand has 69 places, 69 transitions, 145 flow. Second operand 4 states and 243 transitions.
[2024-03-12 01:25:05,148 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 71 transitions, 179 flow
[2024-03-12 01:25:05,150 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 179 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:25:05,153 INFO  L231             Difference]: Finished difference. Result has 73 places, 67 transitions, 153 flow
[2024-03-12 01:25:05,154 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=73, PETRI_TRANSITIONS=67}
[2024-03-12 01:25:05,157 INFO  L281   CegarLoopForPetriNet]: 69 programPoint places, 4 predicate places.
[2024-03-12 01:25:05,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 153 flow
[2024-03-12 01:25:05,158 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,158 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:05,158 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:05,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 01:25:05,158 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-12 01:25:05,159 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:05,159 INFO  L85        PathProgramCache]: Analyzing trace with hash -2113951099, now seen corresponding path program 1 times
[2024-03-12 01:25:05,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:05,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697645657]
[2024-03-12 01:25:05,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:05,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:05,176 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:05,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:05,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:05,210 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697645657]
[2024-03-12 01:25:05,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697645657] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:05,210 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:05,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:25:05,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414686393]
[2024-03-12 01:25:05,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:05,211 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:05,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:05,212 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:05,212 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:05,224 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 69
[2024-03-12 01:25:05,224 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 153 flow. Second operand  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,224 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:05,224 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 69
[2024-03-12 01:25:05,224 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:05,251 INFO  L124   PetriNetUnfolderBase]: 6/128 cut-off events.
[2024-03-12 01:25:05,251 INFO  L125   PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES.
[2024-03-12 01:25:05,252 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 170 conditions, 128 events. 6/128 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 338 event pairs, 4 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 126. Up to 21 conditions per place. 
[2024-03-12 01:25:05,252 INFO  L140   encePairwiseOnDemand]: 64/69 looper letters, 9 selfloop transitions, 4 changer transitions 0/70 dead transitions.
[2024-03-12 01:25:05,252 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 185 flow
[2024-03-12 01:25:05,253 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:05,253 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:05,253 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions.
[2024-03-12 01:25:05,254 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.893719806763285
[2024-03-12 01:25:05,254 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 185 transitions.
[2024-03-12 01:25:05,254 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 185 transitions.
[2024-03-12 01:25:05,254 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:05,254 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 185 transitions.
[2024-03-12 01:25:05,255 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,256 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,256 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,256 INFO  L175             Difference]: Start difference. First operand has 73 places, 67 transitions, 153 flow. Second operand 3 states and 185 transitions.
[2024-03-12 01:25:05,257 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 185 flow
[2024-03-12 01:25:05,258 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 177 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 01:25:05,259 INFO  L231             Difference]: Finished difference. Result has 74 places, 70 transitions, 175 flow
[2024-03-12 01:25:05,259 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=74, PETRI_TRANSITIONS=70}
[2024-03-12 01:25:05,260 INFO  L281   CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places.
[2024-03-12 01:25:05,260 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 175 flow
[2024-03-12 01:25:05,260 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,260 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:05,260 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:05,260 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 01:25:05,261 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-03-12 01:25:05,261 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:05,261 INFO  L85        PathProgramCache]: Analyzing trace with hash 940626546, now seen corresponding path program 1 times
[2024-03-12 01:25:05,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:05,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415367121]
[2024-03-12 01:25:05,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:05,262 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:05,281 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:25:05,281 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:25:05,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:25:05,307 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:25:05,307 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:25:05,308 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining)
[2024-03-12 01:25:05,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining)
[2024-03-12 01:25:05,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining)
[2024-03-12 01:25:05,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining)
[2024-03-12 01:25:05,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining)
[2024-03-12 01:25:05,310 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 01:25:05,310 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-03-12 01:25:05,313 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:25:05,313 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 01:25:05,332 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-12 01:25:05,335 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 190 flow
[2024-03-12 01:25:05,359 INFO  L124   PetriNetUnfolderBase]: 10/174 cut-off events.
[2024-03-12 01:25:05,359 INFO  L125   PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES.
[2024-03-12 01:25:05,360 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 186 conditions, 174 events. 10/174 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 455 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 99. Up to 8 conditions per place. 
[2024-03-12 01:25:05,360 INFO  L82        GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 190 flow
[2024-03-12 01:25:05,361 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 88 places, 87 transitions, 190 flow
[2024-03-12 01:25:05,362 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:25:05,363 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b83c58f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:25:05,363 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-03-12 01:25:05,366 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:25:05,366 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-03-12 01:25:05,366 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:25:05,366 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:05,366 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:05,367 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-12 01:25:05,367 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:05,367 INFO  L85        PathProgramCache]: Analyzing trace with hash 491198239, now seen corresponding path program 1 times
[2024-03-12 01:25:05,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:05,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616011950]
[2024-03-12 01:25:05,367 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:05,368 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:05,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:05,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:05,413 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:05,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616011950]
[2024-03-12 01:25:05,413 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616011950] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:05,413 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:05,413 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:25:05,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443198949]
[2024-03-12 01:25:05,414 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:05,414 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:25:05,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:05,414 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:25:05,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:25:05,439 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 70 out of 87
[2024-03-12 01:25:05,440 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 190 flow. Second operand  has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,440 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:05,440 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 87
[2024-03-12 01:25:05,440 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:05,517 INFO  L124   PetriNetUnfolderBase]: 72/556 cut-off events.
[2024-03-12 01:25:05,517 INFO  L125   PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES.
[2024-03-12 01:25:05,520 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 722 conditions, 556 events. 72/556 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3400 event pairs, 35 based on Foata normal form. 16/523 useless extension candidates. Maximal degree in co-relation 187. Up to 106 conditions per place. 
[2024-03-12 01:25:05,522 INFO  L140   encePairwiseOnDemand]: 80/87 looper letters, 18 selfloop transitions, 4 changer transitions 0/92 dead transitions.
[2024-03-12 01:25:05,522 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 92 transitions, 244 flow
[2024-03-12 01:25:05,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:25:05,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:25:05,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 306 transitions.
[2024-03-12 01:25:05,524 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8793103448275862
[2024-03-12 01:25:05,524 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 306 transitions.
[2024-03-12 01:25:05,524 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 306 transitions.
[2024-03-12 01:25:05,524 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:05,524 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 306 transitions.
[2024-03-12 01:25:05,525 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,526 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,527 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,527 INFO  L175             Difference]: Start difference. First operand has 88 places, 87 transitions, 190 flow. Second operand 4 states and 306 transitions.
[2024-03-12 01:25:05,527 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 92 transitions, 244 flow
[2024-03-12 01:25:05,528 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 92 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:25:05,529 INFO  L231             Difference]: Finished difference. Result has 92 places, 86 transitions, 202 flow
[2024-03-12 01:25:05,530 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=92, PETRI_TRANSITIONS=86}
[2024-03-12 01:25:05,530 INFO  L281   CegarLoopForPetriNet]: 88 programPoint places, 4 predicate places.
[2024-03-12 01:25:05,530 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 202 flow
[2024-03-12 01:25:05,531 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,531 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:05,531 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:05,531 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 01:25:05,531 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-12 01:25:05,531 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:05,532 INFO  L85        PathProgramCache]: Analyzing trace with hash -500886388, now seen corresponding path program 1 times
[2024-03-12 01:25:05,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:05,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636436268]
[2024-03-12 01:25:05,532 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:05,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:05,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:05,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:05,560 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:05,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636436268]
[2024-03-12 01:25:05,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636436268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:05,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:05,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:25:05,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069206989]
[2024-03-12 01:25:05,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:05,561 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:05,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:05,562 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:05,562 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:05,575 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 70 out of 87
[2024-03-12 01:25:05,575 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 202 flow. Second operand  has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,575 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:05,576 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 87
[2024-03-12 01:25:05,576 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:05,672 INFO  L124   PetriNetUnfolderBase]: 116/701 cut-off events.
[2024-03-12 01:25:05,672 INFO  L125   PetriNetUnfolderBase]: For 76/113 co-relation queries the response was YES.
[2024-03-12 01:25:05,674 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 994 conditions, 701 events. 116/701 cut-off events. For 76/113 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4689 event pairs, 58 based on Foata normal form. 2/610 useless extension candidates. Maximal degree in co-relation 921. Up to 185 conditions per place. 
[2024-03-12 01:25:05,676 INFO  L140   encePairwiseOnDemand]: 81/87 looper letters, 18 selfloop transitions, 5 changer transitions 0/94 dead transitions.
[2024-03-12 01:25:05,676 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 94 transitions, 272 flow
[2024-03-12 01:25:05,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:05,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:05,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions.
[2024-03-12 01:25:05,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.896551724137931
[2024-03-12 01:25:05,677 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 234 transitions.
[2024-03-12 01:25:05,678 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 234 transitions.
[2024-03-12 01:25:05,678 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:05,678 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 234 transitions.
[2024-03-12 01:25:05,679 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,679 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,680 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,680 INFO  L175             Difference]: Start difference. First operand has 92 places, 86 transitions, 202 flow. Second operand 3 states and 234 transitions.
[2024-03-12 01:25:05,680 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 94 transitions, 272 flow
[2024-03-12 01:25:05,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 94 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:05,682 INFO  L231             Difference]: Finished difference. Result has 94 places, 90 transitions, 234 flow
[2024-03-12 01:25:05,682 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=94, PETRI_TRANSITIONS=90}
[2024-03-12 01:25:05,683 INFO  L281   CegarLoopForPetriNet]: 88 programPoint places, 6 predicate places.
[2024-03-12 01:25:05,683 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 234 flow
[2024-03-12 01:25:05,683 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,684 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:05,684 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:05,684 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-12 01:25:05,684 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-12 01:25:05,684 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:05,684 INFO  L85        PathProgramCache]: Analyzing trace with hash 827470847, now seen corresponding path program 1 times
[2024-03-12 01:25:05,684 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:05,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996924031]
[2024-03-12 01:25:05,685 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:05,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:05,693 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:05,737 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:25:05,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:05,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996924031]
[2024-03-12 01:25:05,737 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996924031] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:05,737 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:05,738 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:25:05,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453566920]
[2024-03-12 01:25:05,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:05,738 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:25:05,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:05,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:25:05,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:25:05,772 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 70 out of 87
[2024-03-12 01:25:05,773 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 234 flow. Second operand  has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,773 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:05,773 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 87
[2024-03-12 01:25:05,773 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:05,861 INFO  L124   PetriNetUnfolderBase]: 57/514 cut-off events.
[2024-03-12 01:25:05,861 INFO  L125   PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES.
[2024-03-12 01:25:05,862 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 741 conditions, 514 events. 57/514 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2839 event pairs, 20 based on Foata normal form. 15/484 useless extension candidates. Maximal degree in co-relation 588. Up to 66 conditions per place. 
[2024-03-12 01:25:05,863 INFO  L140   encePairwiseOnDemand]: 82/87 looper letters, 20 selfloop transitions, 4 changer transitions 2/101 dead transitions.
[2024-03-12 01:25:05,864 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 101 transitions, 314 flow
[2024-03-12 01:25:05,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:25:05,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:25:05,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 307 transitions.
[2024-03-12 01:25:05,865 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.882183908045977
[2024-03-12 01:25:05,865 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 307 transitions.
[2024-03-12 01:25:05,865 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 307 transitions.
[2024-03-12 01:25:05,865 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:05,865 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 307 transitions.
[2024-03-12 01:25:05,866 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,867 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,867 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,867 INFO  L175             Difference]: Start difference. First operand has 94 places, 90 transitions, 234 flow. Second operand 4 states and 307 transitions.
[2024-03-12 01:25:05,867 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 101 transitions, 314 flow
[2024-03-12 01:25:05,869 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 101 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:05,870 INFO  L231             Difference]: Finished difference. Result has 96 places, 91 transitions, 240 flow
[2024-03-12 01:25:05,870 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=96, PETRI_TRANSITIONS=91}
[2024-03-12 01:25:05,871 INFO  L281   CegarLoopForPetriNet]: 88 programPoint places, 8 predicate places.
[2024-03-12 01:25:05,871 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 240 flow
[2024-03-12 01:25:05,871 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:05,871 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:05,871 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:05,872 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-12 01:25:05,872 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-12 01:25:05,872 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:05,872 INFO  L85        PathProgramCache]: Analyzing trace with hash 579712445, now seen corresponding path program 1 times
[2024-03-12 01:25:05,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:05,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088249016]
[2024-03-12 01:25:05,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:05,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:05,884 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:05,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:05,954 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:05,954 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088249016]
[2024-03-12 01:25:05,954 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088249016] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:25:05,954 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814184988]
[2024-03-12 01:25:05,955 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:05,955 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:25:05,955 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:25:05,957 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:25:05,962 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-12 01:25:06,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:06,054 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-12 01:25:06,056 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:25:06,152 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:06,152 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:25:06,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:06,203 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [814184988] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:25:06,203 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:25:06,203 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2024-03-12 01:25:06,203 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923727978]
[2024-03-12 01:25:06,203 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:25:06,204 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-03-12 01:25:06,204 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:06,204 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-03-12 01:25:06,204 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2024-03-12 01:25:06,267 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 87
[2024-03-12 01:25:06,268 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 240 flow. Second operand  has 13 states, 13 states have (on average 68.92307692307692) internal successors, (896), 13 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:06,268 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:06,269 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 87
[2024-03-12 01:25:06,269 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:06,394 INFO  L124   PetriNetUnfolderBase]: 81/321 cut-off events.
[2024-03-12 01:25:06,394 INFO  L125   PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES.
[2024-03-12 01:25:06,395 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 321 events. 81/321 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1659 event pairs, 1 based on Foata normal form. 15/316 useless extension candidates. Maximal degree in co-relation 520. Up to 56 conditions per place. 
[2024-03-12 01:25:06,396 INFO  L140   encePairwiseOnDemand]: 81/87 looper letters, 28 selfloop transitions, 8 changer transitions 0/85 dead transitions.
[2024-03-12 01:25:06,396 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 276 flow
[2024-03-12 01:25:06,396 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 01:25:06,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 01:25:06,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 708 transitions.
[2024-03-12 01:25:06,398 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8137931034482758
[2024-03-12 01:25:06,398 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 708 transitions.
[2024-03-12 01:25:06,398 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 708 transitions.
[2024-03-12 01:25:06,399 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:06,399 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 708 transitions.
[2024-03-12 01:25:06,400 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 70.8) internal successors, (708), 10 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:06,401 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:06,402 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:06,402 INFO  L175             Difference]: Start difference. First operand has 96 places, 91 transitions, 240 flow. Second operand 10 states and 708 transitions.
[2024-03-12 01:25:06,402 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 276 flow
[2024-03-12 01:25:06,403 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:25:06,403 INFO  L231             Difference]: Finished difference. Result has 79 places, 65 transitions, 179 flow
[2024-03-12 01:25:06,404 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=179, PETRI_PLACES=79, PETRI_TRANSITIONS=65}
[2024-03-12 01:25:06,404 INFO  L281   CegarLoopForPetriNet]: 88 programPoint places, -9 predicate places.
[2024-03-12 01:25:06,404 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 179 flow
[2024-03-12 01:25:06,405 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 68.92307692307692) internal successors, (896), 13 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:06,405 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:06,405 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:06,416 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-12 01:25:06,606 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:25:06,606 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-12 01:25:06,607 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:06,608 INFO  L85        PathProgramCache]: Analyzing trace with hash -488168229, now seen corresponding path program 1 times
[2024-03-12 01:25:06,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:06,608 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289924792]
[2024-03-12 01:25:06,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:06,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:06,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:06,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-12 01:25:06,644 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:06,644 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289924792]
[2024-03-12 01:25:06,644 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289924792] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:06,644 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:06,644 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:25:06,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130326913]
[2024-03-12 01:25:06,645 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:06,645 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:06,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:06,645 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:06,645 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:06,658 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 70 out of 87
[2024-03-12 01:25:06,658 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 179 flow. Second operand  has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:06,659 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:06,659 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 87
[2024-03-12 01:25:06,659 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:06,687 INFO  L124   PetriNetUnfolderBase]: 27/209 cut-off events.
[2024-03-12 01:25:06,687 INFO  L125   PetriNetUnfolderBase]: For 27/31 co-relation queries the response was YES.
[2024-03-12 01:25:06,687 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 348 conditions, 209 events. 27/209 cut-off events. For 27/31 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 790 event pairs, 16 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 340. Up to 55 conditions per place. 
[2024-03-12 01:25:06,688 INFO  L140   encePairwiseOnDemand]: 82/87 looper letters, 13 selfloop transitions, 5 changer transitions 0/70 dead transitions.
[2024-03-12 01:25:06,688 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 70 transitions, 227 flow
[2024-03-12 01:25:06,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:06,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:06,689 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions.
[2024-03-12 01:25:06,689 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8735632183908046
[2024-03-12 01:25:06,689 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 228 transitions.
[2024-03-12 01:25:06,689 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 228 transitions.
[2024-03-12 01:25:06,690 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:06,690 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 228 transitions.
[2024-03-12 01:25:06,690 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:06,691 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:06,691 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:06,691 INFO  L175             Difference]: Start difference. First operand has 79 places, 65 transitions, 179 flow. Second operand 3 states and 228 transitions.
[2024-03-12 01:25:06,691 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 70 transitions, 227 flow
[2024-03-12 01:25:06,692 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 70 transitions, 210 flow, removed 1 selfloop flow, removed 6 redundant places.
[2024-03-12 01:25:06,693 INFO  L231             Difference]: Finished difference. Result has 77 places, 68 transitions, 198 flow
[2024-03-12 01:25:06,693 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=77, PETRI_TRANSITIONS=68}
[2024-03-12 01:25:06,693 INFO  L281   CegarLoopForPetriNet]: 88 programPoint places, -11 predicate places.
[2024-03-12 01:25:06,693 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 198 flow
[2024-03-12 01:25:06,694 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:06,694 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:06,694 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:06,694 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-12 01:25:06,694 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-03-12 01:25:06,694 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:06,694 INFO  L85        PathProgramCache]: Analyzing trace with hash -2104649389, now seen corresponding path program 1 times
[2024-03-12 01:25:06,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:06,695 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521108247]
[2024-03-12 01:25:06,695 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:06,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:06,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:25:06,705 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:25:06,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:25:06,716 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:25:06,716 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:25:06,716 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining)
[2024-03-12 01:25:06,716 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining)
[2024-03-12 01:25:06,716 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining)
[2024-03-12 01:25:06,716 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining)
[2024-03-12 01:25:06,717 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining)
[2024-03-12 01:25:06,717 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining)
[2024-03-12 01:25:06,717 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-12 01:25:06,717 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:06,717 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:25:06,717 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-12 01:25:06,733 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-12 01:25:06,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 237 flow
[2024-03-12 01:25:06,754 INFO  L124   PetriNetUnfolderBase]: 20/300 cut-off events.
[2024-03-12 01:25:06,754 INFO  L125   PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES.
[2024-03-12 01:25:06,754 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 325 conditions, 300 events. 20/300 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 952 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. 
[2024-03-12 01:25:06,754 INFO  L82        GeneralOperation]: Start removeDead. Operand has 107 places, 105 transitions, 237 flow
[2024-03-12 01:25:06,756 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 107 places, 105 transitions, 237 flow
[2024-03-12 01:25:06,756 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:25:06,757 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b83c58f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:25:06,757 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-12 01:25:06,759 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:25:06,759 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-03-12 01:25:06,759 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:25:06,759 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:06,759 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:06,759 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:25:06,759 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:06,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -1594577025, now seen corresponding path program 1 times
[2024-03-12 01:25:06,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:06,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630287846]
[2024-03-12 01:25:06,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:06,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:06,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:06,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:06,790 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:06,790 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630287846]
[2024-03-12 01:25:06,790 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630287846] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:06,790 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:06,790 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:25:06,791 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793603747]
[2024-03-12 01:25:06,791 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:06,791 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:25:06,791 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:06,791 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:25:06,791 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:25:06,807 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105
[2024-03-12 01:25:06,807 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 237 flow. Second operand  has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:06,807 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:06,807 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105
[2024-03-12 01:25:06,807 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:07,000 INFO  L124   PetriNetUnfolderBase]: 412/2153 cut-off events.
[2024-03-12 01:25:07,000 INFO  L125   PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES.
[2024-03-12 01:25:07,005 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2924 conditions, 2153 events. 412/2153 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 18205 event pairs, 175 based on Foata normal form. 64/2024 useless extension candidates. Maximal degree in co-relation 747. Up to 495 conditions per place. 
[2024-03-12 01:25:07,011 INFO  L140   encePairwiseOnDemand]: 98/105 looper letters, 24 selfloop transitions, 4 changer transitions 0/112 dead transitions.
[2024-03-12 01:25:07,011 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 307 flow
[2024-03-12 01:25:07,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:25:07,012 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:25:07,013 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 368 transitions.
[2024-03-12 01:25:07,013 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8761904761904762
[2024-03-12 01:25:07,013 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 368 transitions.
[2024-03-12 01:25:07,013 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 368 transitions.
[2024-03-12 01:25:07,013 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:07,013 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 368 transitions.
[2024-03-12 01:25:07,014 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,015 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,015 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,015 INFO  L175             Difference]: Start difference. First operand has 107 places, 105 transitions, 237 flow. Second operand 4 states and 368 transitions.
[2024-03-12 01:25:07,015 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 112 transitions, 307 flow
[2024-03-12 01:25:07,016 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 307 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:25:07,017 INFO  L231             Difference]: Finished difference. Result has 111 places, 104 transitions, 249 flow
[2024-03-12 01:25:07,018 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=111, PETRI_TRANSITIONS=104}
[2024-03-12 01:25:07,018 INFO  L281   CegarLoopForPetriNet]: 107 programPoint places, 4 predicate places.
[2024-03-12 01:25:07,018 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 249 flow
[2024-03-12 01:25:07,018 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,018 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:07,019 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:07,019 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-12 01:25:07,019 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:25:07,019 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:07,019 INFO  L85        PathProgramCache]: Analyzing trace with hash 50360133, now seen corresponding path program 1 times
[2024-03-12 01:25:07,019 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:07,019 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019801608]
[2024-03-12 01:25:07,019 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:07,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:07,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:07,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:07,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:07,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019801608]
[2024-03-12 01:25:07,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019801608] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:07,040 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:07,040 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:25:07,040 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237237658]
[2024-03-12 01:25:07,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:07,040 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:07,040 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:07,041 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:07,041 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:07,057 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105
[2024-03-12 01:25:07,057 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 104 transitions, 249 flow. Second operand  has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,057 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:07,057 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105
[2024-03-12 01:25:07,057 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:07,383 INFO  L124   PetriNetUnfolderBase]: 1006/3910 cut-off events.
[2024-03-12 01:25:07,383 INFO  L125   PetriNetUnfolderBase]: For 644/714 co-relation queries the response was YES.
[2024-03-12 01:25:07,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5868 conditions, 3910 events. 1006/3910 cut-off events. For 644/714 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 37906 event pairs, 683 based on Foata normal form. 3/3451 useless extension candidates. Maximal degree in co-relation 5644. Up to 1312 conditions per place. 
[2024-03-12 01:25:07,405 INFO  L140   encePairwiseOnDemand]: 98/105 looper letters, 27 selfloop transitions, 6 changer transitions 0/117 dead transitions.
[2024-03-12 01:25:07,405 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 117 transitions, 359 flow
[2024-03-12 01:25:07,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:07,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:07,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions.
[2024-03-12 01:25:07,406 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8984126984126984
[2024-03-12 01:25:07,406 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 283 transitions.
[2024-03-12 01:25:07,406 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions.
[2024-03-12 01:25:07,406 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:07,406 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions.
[2024-03-12 01:25:07,407 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,408 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,408 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,408 INFO  L175             Difference]: Start difference. First operand has 111 places, 104 transitions, 249 flow. Second operand 3 states and 283 transitions.
[2024-03-12 01:25:07,408 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 117 transitions, 359 flow
[2024-03-12 01:25:07,410 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 117 transitions, 353 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:07,411 INFO  L231             Difference]: Finished difference. Result has 113 places, 109 transitions, 289 flow
[2024-03-12 01:25:07,412 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=113, PETRI_TRANSITIONS=109}
[2024-03-12 01:25:07,412 INFO  L281   CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places.
[2024-03-12 01:25:07,412 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 109 transitions, 289 flow
[2024-03-12 01:25:07,412 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,412 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:07,413 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:07,413 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-12 01:25:07,413 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:25:07,413 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:07,413 INFO  L85        PathProgramCache]: Analyzing trace with hash 1375055375, now seen corresponding path program 1 times
[2024-03-12 01:25:07,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:07,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633641249]
[2024-03-12 01:25:07,413 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:07,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:07,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:07,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:25:07,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:07,471 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633641249]
[2024-03-12 01:25:07,471 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633641249] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:07,471 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:07,472 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:25:07,472 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169590318]
[2024-03-12 01:25:07,472 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:07,472 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:25:07,472 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:07,472 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:25:07,472 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:25:07,497 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105
[2024-03-12 01:25:07,497 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 109 transitions, 289 flow. Second operand  has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,497 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:07,497 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105
[2024-03-12 01:25:07,497 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:07,781 INFO  L124   PetriNetUnfolderBase]: 663/3119 cut-off events.
[2024-03-12 01:25:07,781 INFO  L125   PetriNetUnfolderBase]: For 442/462 co-relation queries the response was YES.
[2024-03-12 01:25:07,787 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 3119 events. 663/3119 cut-off events. For 442/462 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 28759 event pairs, 315 based on Foata normal form. 63/2835 useless extension candidates. Maximal degree in co-relation 3795. Up to 540 conditions per place. 
[2024-03-12 01:25:07,795 INFO  L140   encePairwiseOnDemand]: 100/105 looper letters, 31 selfloop transitions, 4 changer transitions 0/125 dead transitions.
[2024-03-12 01:25:07,795 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 125 transitions, 400 flow
[2024-03-12 01:25:07,796 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:25:07,796 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:25:07,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 372 transitions.
[2024-03-12 01:25:07,797 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8857142857142857
[2024-03-12 01:25:07,797 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 372 transitions.
[2024-03-12 01:25:07,797 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 372 transitions.
[2024-03-12 01:25:07,797 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:07,797 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 372 transitions.
[2024-03-12 01:25:07,798 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,798 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,799 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,799 INFO  L175             Difference]: Start difference. First operand has 113 places, 109 transitions, 289 flow. Second operand 4 states and 372 transitions.
[2024-03-12 01:25:07,799 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 125 transitions, 400 flow
[2024-03-12 01:25:07,801 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 125 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:07,803 INFO  L231             Difference]: Finished difference. Result has 115 places, 110 transitions, 293 flow
[2024-03-12 01:25:07,803 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=115, PETRI_TRANSITIONS=110}
[2024-03-12 01:25:07,803 INFO  L281   CegarLoopForPetriNet]: 107 programPoint places, 8 predicate places.
[2024-03-12 01:25:07,803 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 293 flow
[2024-03-12 01:25:07,803 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:07,804 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:07,804 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:07,804 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-12 01:25:07,804 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:25:07,804 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:07,804 INFO  L85        PathProgramCache]: Analyzing trace with hash 1384700150, now seen corresponding path program 1 times
[2024-03-12 01:25:07,804 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:07,804 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133086613]
[2024-03-12 01:25:07,804 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:07,805 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:07,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:07,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:07,870 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:07,870 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133086613]
[2024-03-12 01:25:07,870 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133086613] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:25:07,870 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362763798]
[2024-03-12 01:25:07,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:07,871 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:25:07,871 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:25:07,872 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:25:07,874 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-12 01:25:07,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:07,958 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-12 01:25:07,959 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:25:08,036 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:08,036 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:25:08,080 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:08,080 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [362763798] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:25:08,080 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:25:08,080 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2024-03-12 01:25:08,080 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935409734]
[2024-03-12 01:25:08,081 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:25:08,081 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-03-12 01:25:08,081 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:08,081 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-03-12 01:25:08,082 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2024-03-12 01:25:08,139 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105
[2024-03-12 01:25:08,141 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 293 flow. Second operand  has 13 states, 13 states have (on average 82.92307692307692) internal successors, (1078), 13 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:08,141 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:08,141 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105
[2024-03-12 01:25:08,142 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:08,618 INFO  L124   PetriNetUnfolderBase]: 1016/4219 cut-off events.
[2024-03-12 01:25:08,619 INFO  L125   PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES.
[2024-03-12 01:25:08,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6490 conditions, 4219 events. 1016/4219 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 39766 event pairs, 157 based on Foata normal form. 15/3695 useless extension candidates. Maximal degree in co-relation 3444. Up to 749 conditions per place. 
[2024-03-12 01:25:08,690 INFO  L140   encePairwiseOnDemand]: 97/105 looper letters, 50 selfloop transitions, 11 changer transitions 0/148 dead transitions.
[2024-03-12 01:25:08,691 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 493 flow
[2024-03-12 01:25:08,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 01:25:08,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 01:25:08,694 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 873 transitions.
[2024-03-12 01:25:08,695 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8314285714285714
[2024-03-12 01:25:08,695 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 873 transitions.
[2024-03-12 01:25:08,695 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 873 transitions.
[2024-03-12 01:25:08,696 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:08,696 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 873 transitions.
[2024-03-12 01:25:08,697 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:08,699 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:08,699 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:08,699 INFO  L175             Difference]: Start difference. First operand has 115 places, 110 transitions, 293 flow. Second operand 10 states and 873 transitions.
[2024-03-12 01:25:08,700 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 148 transitions, 493 flow
[2024-03-12 01:25:08,703 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 148 transitions, 487 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:08,704 INFO  L231             Difference]: Finished difference. Result has 125 places, 116 transitions, 343 flow
[2024-03-12 01:25:08,704 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=343, PETRI_PLACES=125, PETRI_TRANSITIONS=116}
[2024-03-12 01:25:08,705 INFO  L281   CegarLoopForPetriNet]: 107 programPoint places, 18 predicate places.
[2024-03-12 01:25:08,705 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 116 transitions, 343 flow
[2024-03-12 01:25:08,705 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 82.92307692307692) internal successors, (1078), 13 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:08,705 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:08,706 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:08,712 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-12 01:25:08,906 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2024-03-12 01:25:08,909 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:25:08,909 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:08,909 INFO  L85        PathProgramCache]: Analyzing trace with hash -763074620, now seen corresponding path program 1 times
[2024-03-12 01:25:08,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:08,909 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145126546]
[2024-03-12 01:25:08,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:08,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:08,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:08,936 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-12 01:25:08,936 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:08,936 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145126546]
[2024-03-12 01:25:08,936 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145126546] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:08,936 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:08,936 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:25:08,937 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050299324]
[2024-03-12 01:25:08,937 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:08,937 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:08,937 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:08,937 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:08,937 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:08,952 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105
[2024-03-12 01:25:08,953 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 116 transitions, 343 flow. Second operand  has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:08,953 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:08,953 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105
[2024-03-12 01:25:08,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:09,351 INFO  L124   PetriNetUnfolderBase]: 897/4370 cut-off events.
[2024-03-12 01:25:09,352 INFO  L125   PetriNetUnfolderBase]: For 1365/1673 co-relation queries the response was YES.
[2024-03-12 01:25:09,362 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7255 conditions, 4370 events. 897/4370 cut-off events. For 1365/1673 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 43470 event pairs, 484 based on Foata normal form. 8/3905 useless extension candidates. Maximal degree in co-relation 2692. Up to 1170 conditions per place. 
[2024-03-12 01:25:09,373 INFO  L140   encePairwiseOnDemand]: 98/105 looper letters, 28 selfloop transitions, 9 changer transitions 0/130 dead transitions.
[2024-03-12 01:25:09,374 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 130 transitions, 468 flow
[2024-03-12 01:25:09,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:09,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:09,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions.
[2024-03-12 01:25:09,375 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8952380952380953
[2024-03-12 01:25:09,375 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 282 transitions.
[2024-03-12 01:25:09,375 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions.
[2024-03-12 01:25:09,375 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:09,376 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions.
[2024-03-12 01:25:09,376 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,377 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,377 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,377 INFO  L175             Difference]: Start difference. First operand has 125 places, 116 transitions, 343 flow. Second operand 3 states and 282 transitions.
[2024-03-12 01:25:09,378 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 130 transitions, 468 flow
[2024-03-12 01:25:09,380 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 130 transitions, 460 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:09,382 INFO  L231             Difference]: Finished difference. Result has 127 places, 123 transitions, 411 flow
[2024-03-12 01:25:09,382 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=127, PETRI_TRANSITIONS=123}
[2024-03-12 01:25:09,382 INFO  L281   CegarLoopForPetriNet]: 107 programPoint places, 20 predicate places.
[2024-03-12 01:25:09,382 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 411 flow
[2024-03-12 01:25:09,382 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,383 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:09,383 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:09,383 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-12 01:25:09,383 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:25:09,383 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:09,384 INFO  L85        PathProgramCache]: Analyzing trace with hash -1467679272, now seen corresponding path program 1 times
[2024-03-12 01:25:09,384 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:09,384 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118341357]
[2024-03-12 01:25:09,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:09,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:09,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:09,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-12 01:25:09,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:09,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118341357]
[2024-03-12 01:25:09,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118341357] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:09,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:09,439 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 01:25:09,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179639404]
[2024-03-12 01:25:09,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:09,440 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:09,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:09,440 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:09,440 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:09,449 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 105
[2024-03-12 01:25:09,449 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 411 flow. Second operand  has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,449 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:09,449 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 105
[2024-03-12 01:25:09,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:09,579 INFO  L124   PetriNetUnfolderBase]: 91/1193 cut-off events.
[2024-03-12 01:25:09,579 INFO  L125   PetriNetUnfolderBase]: For 338/378 co-relation queries the response was YES.
[2024-03-12 01:25:09,582 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 1193 events. 91/1193 cut-off events. For 338/378 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8745 event pairs, 48 based on Foata normal form. 20/1118 useless extension candidates. Maximal degree in co-relation 1594. Up to 106 conditions per place. 
[2024-03-12 01:25:09,584 INFO  L140   encePairwiseOnDemand]: 99/105 looper letters, 12 selfloop transitions, 6 changer transitions 0/122 dead transitions.
[2024-03-12 01:25:09,585 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 432 flow
[2024-03-12 01:25:09,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:09,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:09,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions.
[2024-03-12 01:25:09,586 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9238095238095239
[2024-03-12 01:25:09,586 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 291 transitions.
[2024-03-12 01:25:09,586 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 291 transitions.
[2024-03-12 01:25:09,586 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:09,587 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 291 transitions.
[2024-03-12 01:25:09,587 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,588 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,588 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,588 INFO  L175             Difference]: Start difference. First operand has 127 places, 123 transitions, 411 flow. Second operand 3 states and 291 transitions.
[2024-03-12 01:25:09,588 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 432 flow
[2024-03-12 01:25:09,591 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 122 transitions, 420 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:09,592 INFO  L231             Difference]: Finished difference. Result has 127 places, 117 transitions, 365 flow
[2024-03-12 01:25:09,592 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=365, PETRI_PLACES=127, PETRI_TRANSITIONS=117}
[2024-03-12 01:25:09,593 INFO  L281   CegarLoopForPetriNet]: 107 programPoint places, 20 predicate places.
[2024-03-12 01:25:09,593 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 117 transitions, 365 flow
[2024-03-12 01:25:09,593 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,593 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:09,593 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:09,593 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-12 01:25:09,594 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:25:09,594 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:09,594 INFO  L85        PathProgramCache]: Analyzing trace with hash 1088793250, now seen corresponding path program 1 times
[2024-03-12 01:25:09,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:09,594 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708394554]
[2024-03-12 01:25:09,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:09,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:09,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:09,620 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-03-12 01:25:09,620 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:09,620 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708394554]
[2024-03-12 01:25:09,620 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708394554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:09,620 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:09,620 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:25:09,621 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794768076]
[2024-03-12 01:25:09,621 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:09,621 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:09,621 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:09,621 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:09,621 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:09,639 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105
[2024-03-12 01:25:09,639 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 117 transitions, 365 flow. Second operand  has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,639 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:09,640 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105
[2024-03-12 01:25:09,640 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:09,798 INFO  L124   PetriNetUnfolderBase]: 177/1374 cut-off events.
[2024-03-12 01:25:09,798 INFO  L125   PetriNetUnfolderBase]: For 698/714 co-relation queries the response was YES.
[2024-03-12 01:25:09,800 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 1374 events. 177/1374 cut-off events. For 698/714 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 10839 event pairs, 135 based on Foata normal form. 1/1266 useless extension candidates. Maximal degree in co-relation 2143. Up to 336 conditions per place. 
[2024-03-12 01:25:09,802 INFO  L140   encePairwiseOnDemand]: 100/105 looper letters, 23 selfloop transitions, 4 changer transitions 0/122 dead transitions.
[2024-03-12 01:25:09,802 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 439 flow
[2024-03-12 01:25:09,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:09,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:09,803 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions.
[2024-03-12 01:25:09,803 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.873015873015873
[2024-03-12 01:25:09,803 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 275 transitions.
[2024-03-12 01:25:09,803 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions.
[2024-03-12 01:25:09,804 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:09,804 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions.
[2024-03-12 01:25:09,804 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,805 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,805 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,805 INFO  L175             Difference]: Start difference. First operand has 127 places, 117 transitions, 365 flow. Second operand 3 states and 275 transitions.
[2024-03-12 01:25:09,805 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 439 flow
[2024-03-12 01:25:09,807 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 122 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:25:09,808 INFO  L231             Difference]: Finished difference. Result has 130 places, 120 transitions, 393 flow
[2024-03-12 01:25:09,808 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=130, PETRI_TRANSITIONS=120}
[2024-03-12 01:25:09,809 INFO  L281   CegarLoopForPetriNet]: 107 programPoint places, 23 predicate places.
[2024-03-12 01:25:09,809 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 120 transitions, 393 flow
[2024-03-12 01:25:09,809 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:09,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:09,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-12 01:25:09,809 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-03-12 01:25:09,809 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:09,809 INFO  L85        PathProgramCache]: Analyzing trace with hash 1441453781, now seen corresponding path program 1 times
[2024-03-12 01:25:09,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:09,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015108120]
[2024-03-12 01:25:09,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:09,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:09,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:25:09,820 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:25:09,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:25:09,830 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:25:09,831 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:25:09,831 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-12 01:25:09,831 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-12 01:25:09,831 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-12 01:25:09,831 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-12 01:25:09,831 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-12 01:25:09,831 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-12 01:25:09,831 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-12 01:25:09,831 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-12 01:25:09,832 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:09,832 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:25:09,832 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-03-12 01:25:09,849 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-03-12 01:25:09,850 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 126 places, 123 transitions, 286 flow
[2024-03-12 01:25:09,881 INFO  L124   PetriNetUnfolderBase]: 42/526 cut-off events.
[2024-03-12 01:25:09,881 INFO  L125   PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES.
[2024-03-12 01:25:09,882 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 577 conditions, 526 events. 42/526 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2100 event pairs, 6 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 320. Up to 32 conditions per place. 
[2024-03-12 01:25:09,882 INFO  L82        GeneralOperation]: Start removeDead. Operand has 126 places, 123 transitions, 286 flow
[2024-03-12 01:25:09,884 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 126 places, 123 transitions, 286 flow
[2024-03-12 01:25:09,884 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:25:09,884 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b83c58f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:25:09,885 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-12 01:25:09,886 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:25:09,886 INFO  L124   PetriNetUnfolderBase]: 2/36 cut-off events.
[2024-03-12 01:25:09,886 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:25:09,886 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:09,886 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:09,887 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:09,887 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:09,887 INFO  L85        PathProgramCache]: Analyzing trace with hash 1361473695, now seen corresponding path program 1 times
[2024-03-12 01:25:09,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:09,887 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236338660]
[2024-03-12 01:25:09,887 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:09,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:09,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:09,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:09,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:09,911 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236338660]
[2024-03-12 01:25:09,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236338660] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:09,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:09,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:25:09,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087449746]
[2024-03-12 01:25:09,911 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:09,911 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:25:09,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:09,912 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:25:09,912 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:25:09,927 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 123
[2024-03-12 01:25:09,927 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 123 transitions, 286 flow. Second operand  has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:09,927 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:09,927 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 123
[2024-03-12 01:25:09,927 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:10,595 INFO  L124   PetriNetUnfolderBase]: 2015/8154 cut-off events.
[2024-03-12 01:25:10,595 INFO  L125   PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES.
[2024-03-12 01:25:10,609 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11549 conditions, 8154 events. 2015/8154 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 85631 event pairs, 996 based on Foata normal form. 253/7671 useless extension candidates. Maximal degree in co-relation 2996. Up to 2117 conditions per place. 
[2024-03-12 01:25:10,627 INFO  L140   encePairwiseOnDemand]: 116/123 looper letters, 30 selfloop transitions, 4 changer transitions 0/132 dead transitions.
[2024-03-12 01:25:10,628 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 132 transitions, 372 flow
[2024-03-12 01:25:10,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:25:10,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:25:10,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 430 transitions.
[2024-03-12 01:25:10,629 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8739837398373984
[2024-03-12 01:25:10,629 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 430 transitions.
[2024-03-12 01:25:10,629 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 430 transitions.
[2024-03-12 01:25:10,630 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:10,630 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 430 transitions.
[2024-03-12 01:25:10,631 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:10,631 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:10,632 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:10,632 INFO  L175             Difference]: Start difference. First operand has 126 places, 123 transitions, 286 flow. Second operand 4 states and 430 transitions.
[2024-03-12 01:25:10,632 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 132 transitions, 372 flow
[2024-03-12 01:25:10,633 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 132 transitions, 372 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:25:10,634 INFO  L231             Difference]: Finished difference. Result has 130 places, 122 transitions, 298 flow
[2024-03-12 01:25:10,634 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=130, PETRI_TRANSITIONS=122}
[2024-03-12 01:25:10,634 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 4 predicate places.
[2024-03-12 01:25:10,634 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 122 transitions, 298 flow
[2024-03-12 01:25:10,634 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:10,635 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:10,635 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:10,635 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-12 01:25:10,635 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:10,635 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:10,635 INFO  L85        PathProgramCache]: Analyzing trace with hash 63824480, now seen corresponding path program 1 times
[2024-03-12 01:25:10,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:10,635 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023454989]
[2024-03-12 01:25:10,635 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:10,635 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:10,641 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:10,651 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:10,651 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:10,651 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023454989]
[2024-03-12 01:25:10,651 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023454989] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:10,651 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:10,651 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:25:10,651 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647857468]
[2024-03-12 01:25:10,651 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:10,652 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:10,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:10,652 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:10,652 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:10,669 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 123
[2024-03-12 01:25:10,670 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 122 transitions, 298 flow. Second operand  has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:10,670 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:10,670 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 123
[2024-03-12 01:25:10,670 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:12,843 INFO  L124   PetriNetUnfolderBase]: 7178/23401 cut-off events.
[2024-03-12 01:25:12,843 INFO  L125   PetriNetUnfolderBase]: For 4864/5482 co-relation queries the response was YES.
[2024-03-12 01:25:12,890 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35719 conditions, 23401 events. 7178/23401 cut-off events. For 4864/5482 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 288084 event pairs, 4404 based on Foata normal form. 1/20691 useless extension candidates. Maximal degree in co-relation 34861. Up to 8464 conditions per place. 
[2024-03-12 01:25:12,959 INFO  L140   encePairwiseOnDemand]: 115/123 looper letters, 36 selfloop transitions, 7 changer transitions 0/140 dead transitions.
[2024-03-12 01:25:12,959 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 140 transitions, 450 flow
[2024-03-12 01:25:12,964 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:12,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:12,965 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions.
[2024-03-12 01:25:12,965 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8997289972899729
[2024-03-12 01:25:12,965 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 332 transitions.
[2024-03-12 01:25:12,965 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions.
[2024-03-12 01:25:12,965 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:12,965 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions.
[2024-03-12 01:25:12,966 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:12,967 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:12,967 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:12,967 INFO  L175             Difference]: Start difference. First operand has 130 places, 122 transitions, 298 flow. Second operand 3 states and 332 transitions.
[2024-03-12 01:25:12,967 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 140 transitions, 450 flow
[2024-03-12 01:25:12,984 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 140 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:12,985 INFO  L231             Difference]: Finished difference. Result has 132 places, 128 transitions, 346 flow
[2024-03-12 01:25:12,985 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=132, PETRI_TRANSITIONS=128}
[2024-03-12 01:25:12,985 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 6 predicate places.
[2024-03-12 01:25:12,986 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 346 flow
[2024-03-12 01:25:12,986 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:12,986 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:12,986 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:12,986 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-03-12 01:25:12,986 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:12,986 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:12,987 INFO  L85        PathProgramCache]: Analyzing trace with hash -246559713, now seen corresponding path program 1 times
[2024-03-12 01:25:12,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:12,987 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002707098]
[2024-03-12 01:25:12,987 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:12,987 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:12,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:13,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:25:13,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:13,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002707098]
[2024-03-12 01:25:13,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002707098] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:13,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:13,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 01:25:13,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540411729]
[2024-03-12 01:25:13,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:13,017 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 01:25:13,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:13,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 01:25:13,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 01:25:13,040 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 123
[2024-03-12 01:25:13,041 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 128 transitions, 346 flow. Second operand  has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:13,041 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:13,041 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 123
[2024-03-12 01:25:13,041 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:14,860 INFO  L124   PetriNetUnfolderBase]: 5408/18169 cut-off events.
[2024-03-12 01:25:14,860 INFO  L125   PetriNetUnfolderBase]: For 2822/3020 co-relation queries the response was YES.
[2024-03-12 01:25:14,907 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28417 conditions, 18169 events. 5408/18169 cut-off events. For 2822/3020 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 216173 event pairs, 2935 based on Foata normal form. 259/16111 useless extension candidates. Maximal degree in co-relation 22965. Up to 3899 conditions per place. 
[2024-03-12 01:25:14,958 INFO  L140   encePairwiseOnDemand]: 118/123 looper letters, 40 selfloop transitions, 4 changer transitions 0/149 dead transitions.
[2024-03-12 01:25:14,958 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 149 transitions, 488 flow
[2024-03-12 01:25:14,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 01:25:14,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 01:25:14,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions.
[2024-03-12 01:25:14,960 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8882113821138211
[2024-03-12 01:25:14,960 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 437 transitions.
[2024-03-12 01:25:14,960 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 437 transitions.
[2024-03-12 01:25:14,960 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:14,960 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 437 transitions.
[2024-03-12 01:25:14,961 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:14,962 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:14,962 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:14,962 INFO  L175             Difference]: Start difference. First operand has 132 places, 128 transitions, 346 flow. Second operand 4 states and 437 transitions.
[2024-03-12 01:25:14,963 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 149 transitions, 488 flow
[2024-03-12 01:25:14,971 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 149 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:15,036 INFO  L231             Difference]: Finished difference. Result has 134 places, 129 transitions, 348 flow
[2024-03-12 01:25:15,036 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=134, PETRI_TRANSITIONS=129}
[2024-03-12 01:25:15,036 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 8 predicate places.
[2024-03-12 01:25:15,037 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 348 flow
[2024-03-12 01:25:15,037 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:15,037 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:15,037 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:15,037 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-03-12 01:25:15,037 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:15,037 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:15,037 INFO  L85        PathProgramCache]: Analyzing trace with hash 1641881089, now seen corresponding path program 1 times
[2024-03-12 01:25:15,038 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:15,038 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127748333]
[2024-03-12 01:25:15,038 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:15,038 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:15,047 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:15,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:15,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:15,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127748333]
[2024-03-12 01:25:15,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127748333] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:25:15,095 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299759564]
[2024-03-12 01:25:15,095 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:15,095 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:25:15,095 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:25:15,096 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:25:15,104 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-12 01:25:15,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:15,187 INFO  L262         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-03-12 01:25:15,188 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:25:15,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:15,267 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:25:15,325 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:15,325 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [299759564] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:25:15,325 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:25:15,325 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13
[2024-03-12 01:25:15,326 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977488223]
[2024-03-12 01:25:15,326 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:25:15,326 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-03-12 01:25:15,326 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:15,327 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-03-12 01:25:15,327 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2024-03-12 01:25:15,379 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 123
[2024-03-12 01:25:15,380 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 348 flow. Second operand  has 13 states, 13 states have (on average 96.92307692307692) internal successors, (1260), 13 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:15,381 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:15,381 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 123
[2024-03-12 01:25:15,381 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:17,709 INFO  L124   PetriNetUnfolderBase]: 6986/23994 cut-off events.
[2024-03-12 01:25:17,709 INFO  L125   PetriNetUnfolderBase]: For 3252/3252 co-relation queries the response was YES.
[2024-03-12 01:25:17,787 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37548 conditions, 23994 events. 6986/23994 cut-off events. For 3252/3252 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 299012 event pairs, 1506 based on Foata normal form. 15/20580 useless extension candidates. Maximal degree in co-relation 17739. Up to 4886 conditions per place. 
[2024-03-12 01:25:17,863 INFO  L140   encePairwiseOnDemand]: 115/123 looper letters, 58 selfloop transitions, 11 changer transitions 0/171 dead transitions.
[2024-03-12 01:25:17,864 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 171 transitions, 572 flow
[2024-03-12 01:25:17,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 01:25:17,865 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 01:25:17,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1021 transitions.
[2024-03-12 01:25:17,867 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8300813008130081
[2024-03-12 01:25:17,867 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1021 transitions.
[2024-03-12 01:25:17,867 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1021 transitions.
[2024-03-12 01:25:17,868 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:17,868 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1021 transitions.
[2024-03-12 01:25:17,870 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 102.1) internal successors, (1021), 10 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:17,872 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 123.0) internal successors, (1353), 11 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:17,872 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 123.0) internal successors, (1353), 11 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:17,872 INFO  L175             Difference]: Start difference. First operand has 134 places, 129 transitions, 348 flow. Second operand 10 states and 1021 transitions.
[2024-03-12 01:25:17,872 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 171 transitions, 572 flow
[2024-03-12 01:25:17,896 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 171 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:17,898 INFO  L231             Difference]: Finished difference. Result has 144 places, 135 transitions, 398 flow
[2024-03-12 01:25:17,898 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=398, PETRI_PLACES=144, PETRI_TRANSITIONS=135}
[2024-03-12 01:25:17,898 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 18 predicate places.
[2024-03-12 01:25:17,899 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 135 transitions, 398 flow
[2024-03-12 01:25:17,899 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 96.92307692307692) internal successors, (1260), 13 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:17,899 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:17,900 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:17,906 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-12 01:25:18,101 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:25:18,101 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:18,102 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:18,102 INFO  L85        PathProgramCache]: Analyzing trace with hash 1452146703, now seen corresponding path program 1 times
[2024-03-12 01:25:18,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:18,103 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153080613]
[2024-03-12 01:25:18,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:18,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:18,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:18,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-12 01:25:18,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:18,138 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153080613]
[2024-03-12 01:25:18,139 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153080613] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:18,139 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:18,139 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:25:18,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987182313]
[2024-03-12 01:25:18,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:18,141 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:18,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:18,142 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:18,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:18,171 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 123
[2024-03-12 01:25:18,171 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 135 transitions, 398 flow. Second operand  has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:18,172 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:18,172 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 123
[2024-03-12 01:25:18,172 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:20,744 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L691-->L691-1: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][149], [378#true, Black: 132#(and (<= 4 |ULTIMATE.start_main_~breads_total~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0)), 43#L679true, 149#(<= 4 |ULTIMATE.start_main_~breads_total~0#1|), Black: 137#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 118#L691-1true, Black: 144#(and (<= 4 |ULTIMATE.start_main_~breads_total~0#1|) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 227#(and (<= 4 |ULTIMATE.start_main_~breads_total~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 373#(and (<= 4 |ULTIMATE.start_main_~breads_total~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~breads_total~0#1|)), threadThread1of4ForFork0InUse, 13#L678-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse])
[2024-03-12 01:25:20,744 INFO  L294   olderBase$Statistics]: this new event has 131 ancestors and is cut-off event
[2024-03-12 01:25:20,745 INFO  L297   olderBase$Statistics]:   existing Event has 96 ancestors and is cut-off event
[2024-03-12 01:25:20,745 INFO  L297   olderBase$Statistics]:   existing Event has 96 ancestors and is cut-off event
[2024-03-12 01:25:20,745 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-12 01:25:20,753 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L691-->L691-1: Formula: (= |v_#race~data~0_1| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][149], [378#true, Black: 132#(and (<= 4 |ULTIMATE.start_main_~breads_total~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 137#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 149#(<= 4 |ULTIMATE.start_main_~breads_total~0#1|), 118#L691-1true, Black: 144#(and (<= 4 |ULTIMATE.start_main_~breads_total~0#1|) (= |ULTIMATE.start_main_~i~1#1| 0)), Black: 227#(and (<= 4 |ULTIMATE.start_main_~breads_total~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), 39#L679-3true, Black: 373#(and (<= 4 |ULTIMATE.start_main_~breads_total~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~breads_total~0#1|)), threadThread1of4ForFork0InUse, 13#L678-6true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse])
[2024-03-12 01:25:20,753 INFO  L294   olderBase$Statistics]: this new event has 132 ancestors and is cut-off event
[2024-03-12 01:25:20,753 INFO  L297   olderBase$Statistics]:   existing Event has 132 ancestors and is cut-off event
[2024-03-12 01:25:20,753 INFO  L297   olderBase$Statistics]:   existing Event has 97 ancestors and is cut-off event
[2024-03-12 01:25:20,753 INFO  L297   olderBase$Statistics]:   existing Event has 97 ancestors and is cut-off event
[2024-03-12 01:25:20,798 INFO  L124   PetriNetUnfolderBase]: 8646/28091 cut-off events.
[2024-03-12 01:25:20,798 INFO  L125   PetriNetUnfolderBase]: For 10650/11160 co-relation queries the response was YES.
[2024-03-12 01:25:20,907 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49733 conditions, 28091 events. 8646/28091 cut-off events. For 10650/11160 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 360654 event pairs, 5292 based on Foata normal form. 14/25113 useless extension candidates. Maximal degree in co-relation 41112. Up to 9947 conditions per place. 
[2024-03-12 01:25:21,010 INFO  L140   encePairwiseOnDemand]: 115/123 looper letters, 38 selfloop transitions, 11 changer transitions 0/155 dead transitions.
[2024-03-12 01:25:21,010 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 155 transitions, 575 flow
[2024-03-12 01:25:21,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:21,011 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:21,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions.
[2024-03-12 01:25:21,012 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8970189701897019
[2024-03-12 01:25:21,012 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 331 transitions.
[2024-03-12 01:25:21,012 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions.
[2024-03-12 01:25:21,012 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:21,013 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions.
[2024-03-12 01:25:21,013 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:21,014 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:21,014 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:21,014 INFO  L175             Difference]: Start difference. First operand has 144 places, 135 transitions, 398 flow. Second operand 3 states and 331 transitions.
[2024-03-12 01:25:21,014 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 155 transitions, 575 flow
[2024-03-12 01:25:21,045 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 155 transitions, 567 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:21,047 INFO  L231             Difference]: Finished difference. Result has 146 places, 144 transitions, 486 flow
[2024-03-12 01:25:21,047 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=146, PETRI_TRANSITIONS=144}
[2024-03-12 01:25:21,048 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 20 predicate places.
[2024-03-12 01:25:21,048 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 144 transitions, 486 flow
[2024-03-12 01:25:21,048 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:21,048 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:21,048 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:21,049 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-03-12 01:25:21,049 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:21,049 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:21,049 INFO  L85        PathProgramCache]: Analyzing trace with hash 1473003651, now seen corresponding path program 1 times
[2024-03-12 01:25:21,049 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:21,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101304887]
[2024-03-12 01:25:21,050 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:21,050 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:21,058 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:21,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-03-12 01:25:21,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:21,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101304887]
[2024-03-12 01:25:21,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101304887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:21,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:21,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 01:25:21,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753389579]
[2024-03-12 01:25:21,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:21,094 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:21,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:21,095 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:21,095 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:21,103 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 123
[2024-03-12 01:25:21,104 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 144 transitions, 486 flow. Second operand  has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:21,104 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:21,104 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 123
[2024-03-12 01:25:21,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:21,577 INFO  L124   PetriNetUnfolderBase]: 472/4688 cut-off events.
[2024-03-12 01:25:21,577 INFO  L125   PetriNetUnfolderBase]: For 1557/1713 co-relation queries the response was YES.
[2024-03-12 01:25:21,592 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7307 conditions, 4688 events. 472/4688 cut-off events. For 1557/1713 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 51265 event pairs, 234 based on Foata normal form. 128/4385 useless extension candidates. Maximal degree in co-relation 5303. Up to 454 conditions per place. 
[2024-03-12 01:25:21,601 INFO  L140   encePairwiseOnDemand]: 115/123 looper letters, 16 selfloop transitions, 8 changer transitions 0/142 dead transitions.
[2024-03-12 01:25:21,601 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 142 transitions, 513 flow
[2024-03-12 01:25:21,602 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:21,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:21,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions.
[2024-03-12 01:25:21,603 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9214092140921409
[2024-03-12 01:25:21,603 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 340 transitions.
[2024-03-12 01:25:21,603 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions.
[2024-03-12 01:25:21,603 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:21,604 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions.
[2024-03-12 01:25:21,604 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:21,605 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:21,605 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:21,605 INFO  L175             Difference]: Start difference. First operand has 146 places, 144 transitions, 486 flow. Second operand 3 states and 340 transitions.
[2024-03-12 01:25:21,606 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 142 transitions, 513 flow
[2024-03-12 01:25:21,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 142 transitions, 501 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:21,617 INFO  L231             Difference]: Finished difference. Result has 146 places, 135 transitions, 422 flow
[2024-03-12 01:25:21,617 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=146, PETRI_TRANSITIONS=135}
[2024-03-12 01:25:21,617 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 20 predicate places.
[2024-03-12 01:25:21,617 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 135 transitions, 422 flow
[2024-03-12 01:25:21,618 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:21,618 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:21,618 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:21,618 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-12 01:25:21,618 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:21,619 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:21,619 INFO  L85        PathProgramCache]: Analyzing trace with hash -811832339, now seen corresponding path program 1 times
[2024-03-12 01:25:21,619 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:21,620 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919668688]
[2024-03-12 01:25:21,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:21,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:21,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:21,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-03-12 01:25:21,644 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:21,644 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919668688]
[2024-03-12 01:25:21,644 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919668688] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:21,644 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:21,644 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:25:21,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734817889]
[2024-03-12 01:25:21,645 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:21,645 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:21,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:21,646 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:21,646 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:21,667 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 123
[2024-03-12 01:25:21,668 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 135 transitions, 422 flow. Second operand  has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:21,668 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:21,668 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 123
[2024-03-12 01:25:21,668 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:22,274 INFO  L124   PetriNetUnfolderBase]: 934/5829 cut-off events.
[2024-03-12 01:25:22,275 INFO  L125   PetriNetUnfolderBase]: For 3601/3604 co-relation queries the response was YES.
[2024-03-12 01:25:22,293 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10541 conditions, 5829 events. 934/5829 cut-off events. For 3601/3604 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 66441 event pairs, 666 based on Foata normal form. 1/5318 useless extension candidates. Maximal degree in co-relation 3847. Up to 1548 conditions per place. 
[2024-03-12 01:25:22,306 INFO  L140   encePairwiseOnDemand]: 118/123 looper letters, 30 selfloop transitions, 4 changer transitions 0/142 dead transitions.
[2024-03-12 01:25:22,306 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 142 transitions, 526 flow
[2024-03-12 01:25:22,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:22,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:22,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions.
[2024-03-12 01:25:22,308 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8699186991869918
[2024-03-12 01:25:22,308 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 321 transitions.
[2024-03-12 01:25:22,309 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions.
[2024-03-12 01:25:22,309 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:22,309 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions.
[2024-03-12 01:25:22,310 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:22,310 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:22,310 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:22,310 INFO  L175             Difference]: Start difference. First operand has 146 places, 135 transitions, 422 flow. Second operand 3 states and 321 transitions.
[2024-03-12 01:25:22,311 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 142 transitions, 526 flow
[2024-03-12 01:25:22,315 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 142 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:25:22,317 INFO  L231             Difference]: Finished difference. Result has 149 places, 138 transitions, 448 flow
[2024-03-12 01:25:22,317 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=149, PETRI_TRANSITIONS=138}
[2024-03-12 01:25:22,317 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 23 predicate places.
[2024-03-12 01:25:22,318 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 138 transitions, 448 flow
[2024-03-12 01:25:22,318 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:22,318 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:22,318 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:22,318 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-03-12 01:25:22,319 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:22,319 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:22,319 INFO  L85        PathProgramCache]: Analyzing trace with hash -1238551074, now seen corresponding path program 1 times
[2024-03-12 01:25:22,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:22,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983049773]
[2024-03-12 01:25:22,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:22,320 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:22,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:22,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:22,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:22,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983049773]
[2024-03-12 01:25:22,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983049773] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:25:22,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358757539]
[2024-03-12 01:25:22,443 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:22,443 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:25:22,443 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:25:22,444 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:25:22,448 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-12 01:25:22,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:22,525 INFO  L262         TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core
[2024-03-12 01:25:22,528 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:25:22,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:22,732 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:25:22,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:22,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358757539] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:25:22,832 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:25:22,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19
[2024-03-12 01:25:22,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852979275]
[2024-03-12 01:25:22,833 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:25:22,833 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-03-12 01:25:22,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:22,834 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-03-12 01:25:22,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342
[2024-03-12 01:25:22,921 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 123
[2024-03-12 01:25:22,922 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 138 transitions, 448 flow. Second operand  has 19 states, 19 states have (on average 97.21052631578948) internal successors, (1847), 19 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:22,922 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:22,922 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 123
[2024-03-12 01:25:22,923 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:24,008 INFO  L124   PetriNetUnfolderBase]: 1216/7630 cut-off events.
[2024-03-12 01:25:24,009 INFO  L125   PetriNetUnfolderBase]: For 3305/3571 co-relation queries the response was YES.
[2024-03-12 01:25:24,032 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13259 conditions, 7630 events. 1216/7630 cut-off events. For 3305/3571 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 82847 event pairs, 179 based on Foata normal form. 20/6928 useless extension candidates. Maximal degree in co-relation 5204. Up to 893 conditions per place. 
[2024-03-12 01:25:24,048 INFO  L140   encePairwiseOnDemand]: 115/123 looper letters, 84 selfloop transitions, 14 changer transitions 1/204 dead transitions.
[2024-03-12 01:25:24,049 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 204 transitions, 854 flow
[2024-03-12 01:25:24,049 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-03-12 01:25:24,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-03-12 01:25:24,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1430 transitions.
[2024-03-12 01:25:24,052 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8304297328687572
[2024-03-12 01:25:24,052 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1430 transitions.
[2024-03-12 01:25:24,052 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1430 transitions.
[2024-03-12 01:25:24,053 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:24,053 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1430 transitions.
[2024-03-12 01:25:24,056 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 102.14285714285714) internal successors, (1430), 14 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:24,058 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 123.0) internal successors, (1845), 15 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:24,058 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 123.0) internal successors, (1845), 15 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:24,058 INFO  L175             Difference]: Start difference. First operand has 149 places, 138 transitions, 448 flow. Second operand 14 states and 1430 transitions.
[2024-03-12 01:25:24,058 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 204 transitions, 854 flow
[2024-03-12 01:25:24,065 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 204 transitions, 842 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:24,067 INFO  L231             Difference]: Finished difference. Result has 164 places, 142 transitions, 503 flow
[2024-03-12 01:25:24,067 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=503, PETRI_PLACES=164, PETRI_TRANSITIONS=142}
[2024-03-12 01:25:24,068 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 38 predicate places.
[2024-03-12 01:25:24,068 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 142 transitions, 503 flow
[2024-03-12 01:25:24,068 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 97.21052631578948) internal successors, (1847), 19 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:24,069 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:24,069 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:24,076 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-03-12 01:25:24,270 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2024-03-12 01:25:24,270 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:24,271 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:24,271 INFO  L85        PathProgramCache]: Analyzing trace with hash 1756085178, now seen corresponding path program 1 times
[2024-03-12 01:25:24,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:24,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432969981]
[2024-03-12 01:25:24,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:24,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:24,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:24,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2024-03-12 01:25:24,301 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:24,301 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432969981]
[2024-03-12 01:25:24,301 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432969981] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:24,301 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:24,301 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:25:24,301 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714219685]
[2024-03-12 01:25:24,301 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:24,302 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:24,302 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:24,302 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:24,302 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:24,322 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 123
[2024-03-12 01:25:24,322 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 142 transitions, 503 flow. Second operand  has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:24,322 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:24,322 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 123
[2024-03-12 01:25:24,323 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:24,916 INFO  L124   PetriNetUnfolderBase]: 883/5596 cut-off events.
[2024-03-12 01:25:24,917 INFO  L125   PetriNetUnfolderBase]: For 4222/4222 co-relation queries the response was YES.
[2024-03-12 01:25:24,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10661 conditions, 5596 events. 883/5596 cut-off events. For 4222/4222 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 61598 event pairs, 677 based on Foata normal form. 0/5108 useless extension candidates. Maximal degree in co-relation 9875. Up to 1476 conditions per place. 
[2024-03-12 01:25:24,945 INFO  L140   encePairwiseOnDemand]: 118/123 looper letters, 30 selfloop transitions, 4 changer transitions 0/148 dead transitions.
[2024-03-12 01:25:24,945 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 148 transitions, 598 flow
[2024-03-12 01:25:24,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:24,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:24,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions.
[2024-03-12 01:25:24,946 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8672086720867209
[2024-03-12 01:25:24,947 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 320 transitions.
[2024-03-12 01:25:24,947 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions.
[2024-03-12 01:25:24,947 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:24,947 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions.
[2024-03-12 01:25:24,948 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:24,948 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:24,948 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:24,948 INFO  L175             Difference]: Start difference. First operand has 164 places, 142 transitions, 503 flow. Second operand 3 states and 320 transitions.
[2024-03-12 01:25:24,949 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 148 transitions, 598 flow
[2024-03-12 01:25:24,964 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 148 transitions, 580 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-03-12 01:25:24,966 INFO  L231             Difference]: Finished difference. Result has 161 places, 145 transitions, 521 flow
[2024-03-12 01:25:24,966 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=161, PETRI_TRANSITIONS=145}
[2024-03-12 01:25:24,966 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 35 predicate places.
[2024-03-12 01:25:24,966 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 145 transitions, 521 flow
[2024-03-12 01:25:24,967 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:24,967 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:24,967 INFO  L208   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:24,967 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-12 01:25:24,967 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:24,967 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:24,968 INFO  L85        PathProgramCache]: Analyzing trace with hash -767177864, now seen corresponding path program 1 times
[2024-03-12 01:25:24,968 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:24,968 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866655104]
[2024-03-12 01:25:24,968 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:24,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:24,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:25,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 80 backedges. 52 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:25,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:25,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866655104]
[2024-03-12 01:25:25,094 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866655104] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:25:25,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961677219]
[2024-03-12 01:25:25,094 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:25,095 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:25:25,095 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:25:25,096 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:25:25,104 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-12 01:25:25,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:25,198 INFO  L262         TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core
[2024-03-12 01:25:25,199 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:25:25,461 INFO  L134       CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:25,462 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 01:25:25,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [961677219] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:25,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 01:25:25,462 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21
[2024-03-12 01:25:25,462 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459841605]
[2024-03-12 01:25:25,462 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:25,463 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-03-12 01:25:25,463 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:25,463 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-03-12 01:25:25,463 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420
[2024-03-12 01:25:25,520 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 123
[2024-03-12 01:25:25,521 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 145 transitions, 521 flow. Second operand  has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:25,521 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:25,521 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 123
[2024-03-12 01:25:25,521 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:26,523 INFO  L124   PetriNetUnfolderBase]: 1126/7458 cut-off events.
[2024-03-12 01:25:26,523 INFO  L125   PetriNetUnfolderBase]: For 4837/5141 co-relation queries the response was YES.
[2024-03-12 01:25:26,543 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13762 conditions, 7458 events. 1126/7458 cut-off events. For 4837/5141 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 82095 event pairs, 153 based on Foata normal form. 48/6803 useless extension candidates. Maximal degree in co-relation 5605. Up to 557 conditions per place. 
[2024-03-12 01:25:26,555 INFO  L140   encePairwiseOnDemand]: 115/123 looper letters, 89 selfloop transitions, 16 changer transitions 8/221 dead transitions.
[2024-03-12 01:25:26,555 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 221 transitions, 968 flow
[2024-03-12 01:25:26,556 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-03-12 01:25:26,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2024-03-12 01:25:26,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1650 transitions.
[2024-03-12 01:25:26,557 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8384146341463414
[2024-03-12 01:25:26,557 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1650 transitions.
[2024-03-12 01:25:26,558 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1650 transitions.
[2024-03-12 01:25:26,558 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:26,558 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1650 transitions.
[2024-03-12 01:25:26,560 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 103.125) internal successors, (1650), 16 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:26,562 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 123.0) internal successors, (2091), 17 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:26,562 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 123.0) internal successors, (2091), 17 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:26,562 INFO  L175             Difference]: Start difference. First operand has 161 places, 145 transitions, 521 flow. Second operand 16 states and 1650 transitions.
[2024-03-12 01:25:26,562 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 221 transitions, 968 flow
[2024-03-12 01:25:26,572 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 221 transitions, 946 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-03-12 01:25:26,574 INFO  L231             Difference]: Finished difference. Result has 169 places, 143 transitions, 516 flow
[2024-03-12 01:25:26,574 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=516, PETRI_PLACES=169, PETRI_TRANSITIONS=143}
[2024-03-12 01:25:26,575 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 43 predicate places.
[2024-03-12 01:25:26,575 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 143 transitions, 516 flow
[2024-03-12 01:25:26,575 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:26,576 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:26,576 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:26,585 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-03-12 01:25:26,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:25:26,778 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:26,778 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:26,779 INFO  L85        PathProgramCache]: Analyzing trace with hash 690598843, now seen corresponding path program 1 times
[2024-03-12 01:25:26,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:26,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702484504]
[2024-03-12 01:25:26,779 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:26,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:26,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:26,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-03-12 01:25:26,990 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:26,991 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702484504]
[2024-03-12 01:25:26,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702484504] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:26,991 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:26,991 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:25:26,991 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721258420]
[2024-03-12 01:25:26,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:26,992 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:25:26,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:26,993 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:25:26,993 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:25:27,064 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 123
[2024-03-12 01:25:27,065 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 143 transitions, 516 flow. Second operand  has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:27,065 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:27,065 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 123
[2024-03-12 01:25:27,065 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:27,903 INFO  L124   PetriNetUnfolderBase]: 2334/8321 cut-off events.
[2024-03-12 01:25:27,903 INFO  L125   PetriNetUnfolderBase]: For 3825/4053 co-relation queries the response was YES.
[2024-03-12 01:25:27,930 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17103 conditions, 8321 events. 2334/8321 cut-off events. For 3825/4053 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 87958 event pairs, 950 based on Foata normal form. 0/7602 useless extension candidates. Maximal degree in co-relation 16462. Up to 1797 conditions per place. 
[2024-03-12 01:25:27,948 INFO  L140   encePairwiseOnDemand]: 117/123 looper letters, 55 selfloop transitions, 6 changer transitions 0/174 dead transitions.
[2024-03-12 01:25:27,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 174 transitions, 732 flow
[2024-03-12 01:25:27,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:25:27,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:25:27,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 613 transitions.
[2024-03-12 01:25:27,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8306233062330624
[2024-03-12 01:25:27,950 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 613 transitions.
[2024-03-12 01:25:27,950 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 613 transitions.
[2024-03-12 01:25:27,950 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:27,950 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 613 transitions.
[2024-03-12 01:25:27,951 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:27,952 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:27,952 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:27,952 INFO  L175             Difference]: Start difference. First operand has 169 places, 143 transitions, 516 flow. Second operand 6 states and 613 transitions.
[2024-03-12 01:25:27,952 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 174 transitions, 732 flow
[2024-03-12 01:25:27,985 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 174 transitions, 678 flow, removed 3 selfloop flow, removed 17 redundant places.
[2024-03-12 01:25:27,987 INFO  L231             Difference]: Finished difference. Result has 156 places, 142 transitions, 472 flow
[2024-03-12 01:25:27,987 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=472, PETRI_PLACES=156, PETRI_TRANSITIONS=142}
[2024-03-12 01:25:27,988 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 30 predicate places.
[2024-03-12 01:25:27,988 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 142 transitions, 472 flow
[2024-03-12 01:25:27,988 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:27,988 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:27,988 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:27,988 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-12 01:25:27,989 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:27,989 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:27,989 INFO  L85        PathProgramCache]: Analyzing trace with hash 1177935388, now seen corresponding path program 1 times
[2024-03-12 01:25:27,989 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:27,989 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639167184]
[2024-03-12 01:25:27,989 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:27,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:28,002 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:28,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2024-03-12 01:25:28,022 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:28,022 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639167184]
[2024-03-12 01:25:28,022 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639167184] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:25:28,022 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:25:28,022 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 01:25:28,023 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934002749]
[2024-03-12 01:25:28,023 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:25:28,023 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 01:25:28,023 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:28,023 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 01:25:28,024 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 01:25:28,041 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 123
[2024-03-12 01:25:28,041 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 142 transitions, 472 flow. Second operand  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:28,041 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:28,041 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 123
[2024-03-12 01:25:28,042 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:28,828 INFO  L124   PetriNetUnfolderBase]: 1353/8826 cut-off events.
[2024-03-12 01:25:28,828 INFO  L125   PetriNetUnfolderBase]: For 5188/5188 co-relation queries the response was YES.
[2024-03-12 01:25:28,853 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16867 conditions, 8826 events. 1353/8826 cut-off events. For 5188/5188 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 106062 event pairs, 605 based on Foata normal form. 0/8280 useless extension candidates. Maximal degree in co-relation 16123. Up to 1591 conditions per place. 
[2024-03-12 01:25:28,864 INFO  L140   encePairwiseOnDemand]: 116/123 looper letters, 30 selfloop transitions, 9 changer transitions 1/155 dead transitions.
[2024-03-12 01:25:28,865 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 155 transitions, 606 flow
[2024-03-12 01:25:28,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 01:25:28,866 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 01:25:28,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions.
[2024-03-12 01:25:28,866 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8970189701897019
[2024-03-12 01:25:28,866 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 331 transitions.
[2024-03-12 01:25:28,866 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions.
[2024-03-12 01:25:28,867 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:28,867 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions.
[2024-03-12 01:25:28,867 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:28,868 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:28,868 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:28,868 INFO  L175             Difference]: Start difference. First operand has 156 places, 142 transitions, 472 flow. Second operand 3 states and 331 transitions.
[2024-03-12 01:25:28,868 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 155 transitions, 606 flow
[2024-03-12 01:25:28,917 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 155 transitions, 594 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:25:28,918 INFO  L231             Difference]: Finished difference. Result has 155 places, 146 transitions, 536 flow
[2024-03-12 01:25:28,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=155, PETRI_TRANSITIONS=146}
[2024-03-12 01:25:28,919 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 29 predicate places.
[2024-03-12 01:25:28,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 146 transitions, 536 flow
[2024-03-12 01:25:28,920 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:28,920 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:28,920 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:28,920 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-12 01:25:28,920 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:28,921 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:28,921 INFO  L85        PathProgramCache]: Analyzing trace with hash 887041333, now seen corresponding path program 1 times
[2024-03-12 01:25:28,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:28,921 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103993404]
[2024-03-12 01:25:28,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:28,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:28,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:28,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-03-12 01:25:28,991 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:28,991 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103993404]
[2024-03-12 01:25:28,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103993404] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:25:28,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682244015]
[2024-03-12 01:25:28,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:28,992 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:25:28,992 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:25:28,993 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:25:29,000 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-12 01:25:29,114 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:29,115 INFO  L262         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-12 01:25:29,117 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:25:29,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-03-12 01:25:29,259 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:25:29,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2024-03-12 01:25:29,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682244015] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:25:29,368 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:25:29,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10
[2024-03-12 01:25:29,368 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947057506]
[2024-03-12 01:25:29,369 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:25:29,369 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 01:25:29,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:29,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 01:25:29,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90
[2024-03-12 01:25:29,461 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 123
[2024-03-12 01:25:29,462 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 146 transitions, 536 flow. Second operand  has 10 states, 10 states have (on average 100.4) internal successors, (1004), 10 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:29,462 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:29,462 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 123
[2024-03-12 01:25:29,463 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:30,174 INFO  L124   PetriNetUnfolderBase]: 1022/5636 cut-off events.
[2024-03-12 01:25:30,174 INFO  L125   PetriNetUnfolderBase]: For 3737/3938 co-relation queries the response was YES.
[2024-03-12 01:25:30,191 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10804 conditions, 5636 events. 1022/5636 cut-off events. For 3737/3938 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 56930 event pairs, 222 based on Foata normal form. 80/5563 useless extension candidates. Maximal degree in co-relation 10158. Up to 562 conditions per place. 
[2024-03-12 01:25:30,200 INFO  L140   encePairwiseOnDemand]: 117/123 looper letters, 53 selfloop transitions, 7 changer transitions 8/189 dead transitions.
[2024-03-12 01:25:30,200 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 189 transitions, 812 flow
[2024-03-12 01:25:30,201 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:25:30,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:25:30,201 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions.
[2024-03-12 01:25:30,202 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8821138211382114
[2024-03-12 01:25:30,202 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 651 transitions.
[2024-03-12 01:25:30,202 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions.
[2024-03-12 01:25:30,202 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:30,202 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions.
[2024-03-12 01:25:30,203 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:30,204 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:30,204 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:30,204 INFO  L175             Difference]: Start difference. First operand has 155 places, 146 transitions, 536 flow. Second operand 6 states and 651 transitions.
[2024-03-12 01:25:30,204 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 189 transitions, 812 flow
[2024-03-12 01:25:30,214 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 189 transitions, 794 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:30,215 INFO  L231             Difference]: Finished difference. Result has 160 places, 148 transitions, 550 flow
[2024-03-12 01:25:30,216 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=160, PETRI_TRANSITIONS=148}
[2024-03-12 01:25:30,216 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 34 predicate places.
[2024-03-12 01:25:30,216 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 148 transitions, 550 flow
[2024-03-12 01:25:30,217 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 100.4) internal successors, (1004), 10 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:30,217 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:30,217 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:30,224 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-03-12 01:25:30,417 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:25:30,417 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:30,418 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:30,418 INFO  L85        PathProgramCache]: Analyzing trace with hash 1073569415, now seen corresponding path program 1 times
[2024-03-12 01:25:30,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:30,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59611359]
[2024-03-12 01:25:30,419 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:30,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:30,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:31,551 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:31,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:31,552 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59611359]
[2024-03-12 01:25:31,552 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59611359] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:25:31,552 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521267299]
[2024-03-12 01:25:31,552 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:31,552 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:25:31,553 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:25:31,553 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:25:31,557 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-12 01:25:31,650 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:31,652 INFO  L262         TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 36 conjunts are in the unsatisfiable core
[2024-03-12 01:25:31,658 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:25:32,169 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-03-12 01:25:32,320 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:25:32,321 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2024-03-12 01:25:32,593 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-12 01:25:32,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:32,644 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:25:34,410 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-12 01:25:34,416 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 112
[2024-03-12 01:25:34,571 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48
[2024-03-12 01:25:34,657 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 228
[2024-03-12 01:25:35,696 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:35,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [521267299] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:25:35,696 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:25:35,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 54
[2024-03-12 01:25:35,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774797744]
[2024-03-12 01:25:35,697 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:25:35,697 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 54 states
[2024-03-12 01:25:35,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:35,698 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants.
[2024-03-12 01:25:35,699 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2600, Unknown=0, NotChecked=0, Total=2862
[2024-03-12 01:25:43,187 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 123
[2024-03-12 01:25:43,192 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 148 transitions, 550 flow. Second operand  has 54 states, 54 states have (on average 88.5925925925926) internal successors, (4784), 54 states have internal predecessors, (4784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:43,192 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:25:43,192 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 123
[2024-03-12 01:25:43,192 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:47,426 INFO  L124   PetriNetUnfolderBase]: 1748/6942 cut-off events.
[2024-03-12 01:25:47,426 INFO  L125   PetriNetUnfolderBase]: For 4565/4761 co-relation queries the response was YES.
[2024-03-12 01:25:47,447 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15124 conditions, 6942 events. 1748/6942 cut-off events. For 4565/4761 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 68591 event pairs, 87 based on Foata normal form. 24/6741 useless extension candidates. Maximal degree in co-relation 6214. Up to 893 conditions per place. 
[2024-03-12 01:25:47,460 INFO  L140   encePairwiseOnDemand]: 105/123 looper letters, 138 selfloop transitions, 29 changer transitions 8/277 dead transitions.
[2024-03-12 01:25:47,460 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 277 transitions, 1281 flow
[2024-03-12 01:25:47,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-12 01:25:47,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-12 01:25:47,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2411 transitions.
[2024-03-12 01:25:47,463 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7539086929330832
[2024-03-12 01:25:47,464 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 2411 transitions.
[2024-03-12 01:25:47,464 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 2411 transitions.
[2024-03-12 01:25:47,464 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:47,464 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2411 transitions.
[2024-03-12 01:25:47,467 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 92.73076923076923) internal successors, (2411), 26 states have internal predecessors, (2411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:47,470 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 123.0) internal successors, (3321), 27 states have internal predecessors, (3321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:47,470 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 123.0) internal successors, (3321), 27 states have internal predecessors, (3321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:47,470 INFO  L175             Difference]: Start difference. First operand has 160 places, 148 transitions, 550 flow. Second operand 26 states and 2411 transitions.
[2024-03-12 01:25:47,470 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 277 transitions, 1281 flow
[2024-03-12 01:25:47,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 277 transitions, 1273 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 01:25:47,482 INFO  L231             Difference]: Finished difference. Result has 192 places, 157 transitions, 658 flow
[2024-03-12 01:25:47,482 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=658, PETRI_PLACES=192, PETRI_TRANSITIONS=157}
[2024-03-12 01:25:47,483 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 66 predicate places.
[2024-03-12 01:25:47,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 157 transitions, 658 flow
[2024-03-12 01:25:47,484 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 54 states, 54 states have (on average 88.5925925925926) internal successors, (4784), 54 states have internal predecessors, (4784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:25:47,484 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:25:47,484 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:25:47,489 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-12 01:25:47,687 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30
[2024-03-12 01:25:47,688 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:25:47,689 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:25:47,689 INFO  L85        PathProgramCache]: Analyzing trace with hash 1574974517, now seen corresponding path program 2 times
[2024-03-12 01:25:47,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:25:47,690 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179958624]
[2024-03-12 01:25:47,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:25:47,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:25:47,723 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:25:48,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:48,816 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:25:48,816 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179958624]
[2024-03-12 01:25:48,816 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179958624] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:25:48,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037008789]
[2024-03-12 01:25:48,817 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 01:25:48,817 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:25:48,817 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:25:48,818 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:25:48,821 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-12 01:25:48,950 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 01:25:48,950 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:25:48,952 INFO  L262         TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 40 conjunts are in the unsatisfiable core
[2024-03-12 01:25:48,957 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:25:49,486 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-03-12 01:25:49,656 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:25:49,657 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2024-03-12 01:25:49,828 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-12 01:25:49,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:49,869 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:25:51,495 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92
[2024-03-12 01:25:51,501 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 324 treesize of output 292
[2024-03-12 01:25:51,616 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93
[2024-03-12 01:25:51,628 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 300
[2024-03-12 01:25:55,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:25:55,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037008789] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:25:55,021 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:25:55,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 19] total 53
[2024-03-12 01:25:55,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039918800]
[2024-03-12 01:25:55,022 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:25:55,022 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 53 states
[2024-03-12 01:25:55,023 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:25:55,023 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants.
[2024-03-12 01:25:55,024 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2514, Unknown=0, NotChecked=0, Total=2756
[2024-03-12 01:26:02,093 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:26:06,113 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:26:16,687 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-12 01:26:17,113 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 123
[2024-03-12 01:26:17,116 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 157 transitions, 658 flow. Second operand  has 53 states, 53 states have (on average 86.84905660377359) internal successors, (4603), 53 states have internal predecessors, (4603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:26:17,116 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:26:17,116 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 123
[2024-03-12 01:26:17,116 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:26:21,884 INFO  L124   PetriNetUnfolderBase]: 1740/6567 cut-off events.
[2024-03-12 01:26:21,884 INFO  L125   PetriNetUnfolderBase]: For 5396/5560 co-relation queries the response was YES.
[2024-03-12 01:26:21,907 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15501 conditions, 6567 events. 1740/6567 cut-off events. For 5396/5560 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 63113 event pairs, 117 based on Foata normal form. 24/6350 useless extension candidates. Maximal degree in co-relation 7244. Up to 898 conditions per place. 
[2024-03-12 01:26:21,918 INFO  L140   encePairwiseOnDemand]: 105/123 looper letters, 135 selfloop transitions, 30 changer transitions 8/272 dead transitions.
[2024-03-12 01:26:21,918 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 272 transitions, 1374 flow
[2024-03-12 01:26:21,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2024-03-12 01:26:21,919 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2024-03-12 01:26:21,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2441 transitions.
[2024-03-12 01:26:21,921 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7350195724179464
[2024-03-12 01:26:21,922 INFO  L72            ComplementDD]: Start complementDD. Operand 27 states and 2441 transitions.
[2024-03-12 01:26:21,922 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 27 states and 2441 transitions.
[2024-03-12 01:26:21,922 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:26:21,922 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2441 transitions.
[2024-03-12 01:26:21,925 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 28 states, 27 states have (on average 90.4074074074074) internal successors, (2441), 27 states have internal predecessors, (2441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:26:21,927 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 28 states, 28 states have (on average 123.0) internal successors, (3444), 28 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:26:21,927 INFO  L81            ComplementDD]: Finished complementDD. Result  has 28 states, 28 states have (on average 123.0) internal successors, (3444), 28 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:26:21,928 INFO  L175             Difference]: Start difference. First operand has 192 places, 157 transitions, 658 flow. Second operand 27 states and 2441 transitions.
[2024-03-12 01:26:21,928 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 272 transitions, 1374 flow
[2024-03-12 01:26:21,939 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 272 transitions, 1331 flow, removed 1 selfloop flow, removed 17 redundant places.
[2024-03-12 01:26:21,941 INFO  L231             Difference]: Finished difference. Result has 205 places, 160 transitions, 710 flow
[2024-03-12 01:26:21,941 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=710, PETRI_PLACES=205, PETRI_TRANSITIONS=160}
[2024-03-12 01:26:21,942 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 79 predicate places.
[2024-03-12 01:26:21,942 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 160 transitions, 710 flow
[2024-03-12 01:26:21,943 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 53 states, 53 states have (on average 86.84905660377359) internal successors, (4603), 53 states have internal predecessors, (4603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:26:21,943 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:26:21,943 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:26:21,950 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2024-03-12 01:26:22,144 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31
[2024-03-12 01:26:22,145 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2024-03-12 01:26:22,145 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:26:22,145 INFO  L85        PathProgramCache]: Analyzing trace with hash -1876393632, now seen corresponding path program 1 times
[2024-03-12 01:26:22,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:26:22,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728898282]
[2024-03-12 01:26:22,146 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:26:22,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:26:22,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:26:22,167 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:26:22,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:26:22,188 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:26:22,188 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:26:22,188 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining)
[2024-03-12 01:26:22,188 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2024-03-12 01:26:22,188 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2024-03-12 01:26:22,189 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2024-03-12 01:26:22,189 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2024-03-12 01:26:22,189 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2024-03-12 01:26:22,189 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2024-03-12 01:26:22,189 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2024-03-12 01:26:22,189 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-03-12 01:26:22,189 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:26:22,193 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances
[2024-03-12 01:26:22,193 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-12 01:26:22,242 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:26:22,243 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,243 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,243 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post4 could not be translated
[2024-03-12 01:26:22,244 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,244 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,244 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,244 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:26:22,244 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,245 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,245 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,245 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:26:22,245 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,246 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,246 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,246 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,246 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,246 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,246 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,247 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,247 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,247 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,247 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,247 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,248 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,248 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,248 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,248 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:26:22,248 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,249 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,249 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,249 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,249 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,249 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,249 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:26:22,250 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,250 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,250 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,250 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,250 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,251 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,251 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,251 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,251 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,251 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,252 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,252 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,252 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,252 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,252 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,252 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,252 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,253 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,253 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,253 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,253 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,253 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,254 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,254 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,254 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,254 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,254 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,255 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,255 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,255 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,255 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,255 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,255 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,256 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,256 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,256 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,256 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,256 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,257 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,257 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,257 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,257 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,257 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,258 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,258 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:26:22,258 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,258 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,258 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,259 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,268 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.03 01:26:22 BasicIcfg
[2024-03-12 01:26:22,268 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-12 01:26:22,268 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-12 01:26:22,268 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-03-12 01:26:22,269 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-03-12 01:26:22,269 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:25:04" (3/4) ...
[2024-03-12 01:26:22,271 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-12 01:26:22,272 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-12 01:26:22,272 INFO  L158              Benchmark]: Toolchain (without parser) took 78365.91ms. Allocated memory was 98.6MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 43.0MB in the beginning and 3.7GB in the end (delta: -3.7GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB.
[2024-03-12 01:26:22,273 INFO  L158              Benchmark]: CDTParser took 0.21ms. Allocated memory is still 98.6MB. Free memory was 68.4MB in the beginning and 68.3MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-12 01:26:22,273 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 328.34ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 43.0MB in the beginning and 85.2MB in the end (delta: -42.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB.
[2024-03-12 01:26:22,273 INFO  L158              Benchmark]: Boogie Procedure Inliner took 40.29ms. Allocated memory is still 119.5MB. Free memory was 85.2MB in the beginning and 83.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-12 01:26:22,273 INFO  L158              Benchmark]: Boogie Preprocessor took 21.64ms. Allocated memory is still 119.5MB. Free memory was 83.2MB in the beginning and 81.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-12 01:26:22,274 INFO  L158              Benchmark]: RCFGBuilder took 345.81ms. Allocated memory is still 119.5MB. Free memory was 81.8MB in the beginning and 67.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-03-12 01:26:22,274 INFO  L158              Benchmark]: TraceAbstraction took 77621.19ms. Allocated memory was 119.5MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 67.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB.
[2024-03-12 01:26:22,274 INFO  L158              Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 6.1GB. Free memory is still 3.7GB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-12 01:26:22,275 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.21ms. Allocated memory is still 98.6MB. Free memory was 68.4MB in the beginning and 68.3MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 328.34ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 43.0MB in the beginning and 85.2MB in the end (delta: -42.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 40.29ms. Allocated memory is still 119.5MB. Free memory was 85.2MB in the beginning and 83.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 21.64ms. Allocated memory is still 119.5MB. Free memory was 83.2MB in the beginning and 81.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
 * RCFGBuilder took 345.81ms. Allocated memory is still 119.5MB. Free memory was 81.8MB in the beginning and 67.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 77621.19ms. Allocated memory was 119.5MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 67.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB.
 * Witness Printer took 3.38ms. Allocated memory is still 6.1GB. Free memory is still 3.7GB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~post4 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - DataRaceFoundResult [Line: 678]: Data race detected
[2024-03-12 01:26:22,319 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:26:22,319 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,320 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,320 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post4 could not be translated
[2024-03-12 01:26:22,320 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,320 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,320 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:26:22,321 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,321 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,321 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,321 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,321 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:26:22,322 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,322 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,322 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,322 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,322 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,322 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,323 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,323 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,323 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,323 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,323 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,323 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,324 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,324 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,324 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,324 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:26:22,324 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,324 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,324 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,325 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,325 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,325 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,325 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:26:22,325 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,325 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,326 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,326 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,326 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,326 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,326 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,326 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,327 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,327 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,327 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,327 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,327 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,327 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,328 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,328 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,328 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,328 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,328 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,328 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,328 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,329 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,329 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,329 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,329 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,329 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,330 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,330 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,330 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,330 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,330 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,330 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,330 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,331 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,331 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,331 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,331 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,331 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,331 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,332 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,332 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,332 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,332 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,332 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,332 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:26:22,333 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,333 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,333 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,333 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,366 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:26:22,366 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,367 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,367 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post4 could not be translated
[2024-03-12 01:26:22,367 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,367 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,367 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,368 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:26:22,368 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,368 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,368 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:26:22,368 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,369 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,369 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,369 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,369 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,369 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,369 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,370 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,370 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,370 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,370 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,370 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,370 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,370 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,371 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-03-12 01:26:22,371 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,371 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,371 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,371 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,371 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,372 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,372 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,372 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,372 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:26:22,372 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,372 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,372 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,373 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,373 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,373 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,373 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,373 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,373 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,373 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,374 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,374 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,374 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,374 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,374 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,374 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,374 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,375 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,375 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,375 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,375 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,375 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,375 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,376 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,376 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,376 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,376 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,376 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,376 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,377 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,377 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,377 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,377 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,377 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,377 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-12 01:26:22,377 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,378 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,378 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,378 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,378 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated
[2024-03-12 01:26:22,378 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,378 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,378 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,379 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,379 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-12 01:26:22,379 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,379 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-03-12 01:26:22,379 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-03-12 01:26:22,379 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
    Data race detected
The following path leads to a data race: 
[L674]               0  int data = 0;
        VAL             [data=0]
[L675]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
        VAL             [data=0, data_mutex={1:0}]
[L683]               0  int breads_total = 4;
        VAL             [breads_total=4, data=0, data_mutex={1:0}]
[L684]               0  pthread_t tids[4];
        VAL             [breads_total=4, data=0, data_mutex={1:0}, tids={5:0}]
[L685]               0  int i = 0;
        VAL             [breads_total=4, data=0, data_mutex={1:0}, i=0, tids={5:0}]
[L685]  COND TRUE    0  i < breads_total
        VAL             [breads_total=4, data=0, data_mutex={1:0}, i=0, tids={5:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={5:0}]
[L678]               1  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L685]               0  i++
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={5:0}]
[L685]               0  i++
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={5:0}]
[L685]  COND TRUE    0  i < breads_total
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={5:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=1, tids={5:0}]
[L685]               0  i++
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={5:0}]
[L685]  COND TRUE    0  i < breads_total
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={5:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={5:0}]
[L678]               3  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L678]               2  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L685]               0  i++
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=3, tids={5:0}]
[L685]  COND TRUE    0  i < breads_total
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=3, tids={5:0}]
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=3, tids={5:0}]
[L685]               0  i++
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, tids={5:0}]
[L685]  COND FALSE   0  !(i < breads_total)
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, tids={5:0}]
[L688]               0  int i = 0;
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={5:0}]
[L688]  COND TRUE    0  i < breads_total
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={5:0}]
[L689]  EXPR         0  tids[i]
        VAL             [arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={5:0}]
[L680]               1  return ((void *)0);
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={5:0}]
[L689]  FCALL, JOIN  1  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=0, tids={5:0}]
[L688]               0  i += 2
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={5:0}]
[L688]  COND TRUE    0  i < breads_total
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={5:0}]
[L689]  EXPR         0  tids[i]
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={5:0}]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={5:0}]
[L680]               3  return ((void *)0);
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L689]  FCALL, JOIN  3  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=2, tids={5:0}]
[L688]               0  i += 2
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, tids={5:0}]
[L688]  COND FALSE   0  !(i < breads_total)
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, i=4, tids={5:0}]
[L691]               0  return data;
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, breads_total=4, data=0, data_mutex={1:0}, tids={5:0}]
[L678]               2  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]

Now there is a data race on ~data~0 between 
	C: return data; [691]
and
	C: data = __VERIFIER_nondet_int() [678]

  - UnprovableResult [Line: 691]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 689]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 686]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 84 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 3 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 61 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 101 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 21 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 450 SizeOfPredicates, 4 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances
    CFG has 5 procedures, 118 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.1s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 550 IncrementalHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 49 mSDtfsCounter, 550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 588 SizeOfPredicates, 4 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 31/34 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances
    CFG has 6 procedures, 135 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 72.3s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 56.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 3334 SdHoareTripleChecker+Valid, 36.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3075 mSDsluCounter, 7726 SdHoareTripleChecker+Invalid, 33.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7648 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24724 IncrementalHoareTripleChecker+Invalid, 24766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 78 mSDtfsCounter, 24724 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1057 GetRequests, 826 SyntacticMatches, 7 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3748 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=710occurred in iteration=15, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 1519 NumberOfCodeBlocks, 1519 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1798 ConstructedInterpolants, 28 QuantifiedInterpolants, 23945 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1191 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 553/1112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-03-12 01:26:22,436 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
