./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/per-thread-struct-in-array.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/per-thread-struct-in-array.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 4fb1735e9845827405e7e45ebebfc6a1d8f191007cb56c7ae73b72372f4d3857
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 06:00:42,473 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 06:00:42,539 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 06:00:42,543 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 06:00:42,543 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 06:00:42,558 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 06:00:42,558 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 06:00:42,558 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 06:00:42,559 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 06:00:42,559 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 06:00:42,559 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 06:00:42,560 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 06:00:42,560 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 06:00:42,560 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 06:00:42,560 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 06:00:42,561 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 06:00:42,561 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 06:00:42,561 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 06:00:42,562 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 06:00:42,562 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 06:00:42,562 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 06:00:42,563 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 06:00:42,563 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 06:00:42,563 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 06:00:42,563 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 06:00:42,564 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 06:00:42,564 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 06:00:42,564 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 06:00:42,564 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 06:00:42,565 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 06:00:42,565 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 06:00:42,565 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 06:00:42,565 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 06:00:42,566 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 06:00:42,566 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 06:00:42,566 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 06:00:42,566 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 06:00:42,567 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 06:00:42,567 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 06:00:42,567 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 06:00:42,567 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 06:00:42,568 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 -> 4fb1735e9845827405e7e45ebebfc6a1d8f191007cb56c7ae73b72372f4d3857
[2024-03-09 06:00:42,721 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 06:00:42,741 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 06:00:42,743 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 06:00:42,744 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 06:00:42,746 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 06:00:42,747 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.i
[2024-03-09 06:00:43,723 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 06:00:43,932 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 06:00:43,932 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.i
[2024-03-09 06:00:43,945 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/ba7fc1d6b/c74d60aefc9e47cab1ffda156f49c419/FLAGcb232820c
[2024-03-09 06:00:43,955 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/ba7fc1d6b/c74d60aefc9e47cab1ffda156f49c419
[2024-03-09 06:00:43,957 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 06:00:43,958 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 06:00:43,959 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 06:00:43,959 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 06:00:43,963 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 06:00:43,964 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:00:43" (1/1) ...
[2024-03-09 06:00:43,965 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@188c235a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:43, skipping insertion in model container
[2024-03-09 06:00:43,965 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:00:43" (1/1) ...
[2024-03-09 06:00:43,998 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 06:00:44,247 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 06:00:44,253 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 06:00:44,285 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 06:00:44,320 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 06:00:44,320 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44 WrapperNode
[2024-03-09 06:00:44,320 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 06:00:44,321 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 06:00:44,321 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 06:00:44,321 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 06:00:44,326 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44" (1/1) ...
[2024-03-09 06:00:44,340 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44" (1/1) ...
[2024-03-09 06:00:44,358 INFO  L138                Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99
[2024-03-09 06:00:44,358 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 06:00:44,359 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 06:00:44,359 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 06:00:44,359 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 06:00:44,366 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44" (1/1) ...
[2024-03-09 06:00:44,366 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44" (1/1) ...
[2024-03-09 06:00:44,370 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44" (1/1) ...
[2024-03-09 06:00:44,370 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44" (1/1) ...
[2024-03-09 06:00:44,377 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44" (1/1) ...
[2024-03-09 06:00:44,380 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44" (1/1) ...
[2024-03-09 06:00:44,381 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44" (1/1) ...
[2024-03-09 06:00:44,382 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44" (1/1) ...
[2024-03-09 06:00:44,384 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 06:00:44,385 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 06:00:44,385 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 06:00:44,385 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 06:00:44,386 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44" (1/1) ...
[2024-03-09 06:00:44,390 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 06:00:44,397 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:00:44,408 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-09 06:00:44,411 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-09 06:00:44,438 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 06:00:44,438 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 06:00:44,438 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 06:00:44,439 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 06:00:44,439 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 06:00:44,439 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 06:00:44,439 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 06:00:44,439 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 06:00:44,439 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 06:00:44,439 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 06:00:44,439 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 06:00:44,440 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 06:00:44,574 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 06:00:44,575 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 06:00:44,752 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 06:00:44,761 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 06:00:44,761 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 06:00:44,762 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:00:44 BoogieIcfgContainer
[2024-03-09 06:00:44,762 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 06:00:44,764 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 06:00:44,764 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 06:00:44,766 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 06:00:44,766 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:00:43" (1/3) ...
[2024-03-09 06:00:44,767 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f41c206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:00:44, skipping insertion in model container
[2024-03-09 06:00:44,767 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:00:44" (2/3) ...
[2024-03-09 06:00:44,767 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f41c206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:00:44, skipping insertion in model container
[2024-03-09 06:00:44,767 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:00:44" (3/3) ...
[2024-03-09 06:00:44,768 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array.i
[2024-03-09 06:00:44,774 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 06:00:44,781 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 06:00:44,781 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2024-03-09 06:00:44,781 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 06:00:44,831 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 06:00:44,856 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow
[2024-03-09 06:00:44,903 INFO  L124   PetriNetUnfolderBase]: 6/188 cut-off events.
[2024-03-09 06:00:44,903 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 06:00:44,907 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 193 conditions, 188 events. 6/188 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 380 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. 
[2024-03-09 06:00:44,907 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 251 flow
[2024-03-09 06:00:44,911 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 251 flow
[2024-03-09 06:00:44,918 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:00:44,923 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;@15fe4d58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:00:44,923 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-09 06:00:44,930 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:00:44,930 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-03-09 06:00:44,931 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:00:44,931 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:00:44,931 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]
[2024-03-09 06:00:44,932 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:00:44,936 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:00:44,936 INFO  L85        PathProgramCache]: Analyzing trace with hash 625921240, now seen corresponding path program 1 times
[2024-03-09 06:00:44,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:00:44,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227116594]
[2024-03-09 06:00:44,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:44,944 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:00:45,046 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:45,465 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-09 06:00:45,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:00:45,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227116594]
[2024-03-09 06:00:45,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227116594] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:00:45,466 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:00:45,466 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:00:45,467 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100986140]
[2024-03-09 06:00:45,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:00:45,474 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:00:45,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:00:45,497 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:00:45,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:00:45,900 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122
[2024-03-09 06:00:45,904 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 251 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-09 06:00:45,904 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:00:45,904 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122
[2024-03-09 06:00:45,905 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:00:46,077 INFO  L124   PetriNetUnfolderBase]: 81/497 cut-off events.
[2024-03-09 06:00:46,078 INFO  L125   PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES.
[2024-03-09 06:00:46,079 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 711 conditions, 497 events. 81/497 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2282 event pairs, 6 based on Foata normal form. 12/466 useless extension candidates. Maximal degree in co-relation 591. Up to 140 conditions per place. 
[2024-03-09 06:00:46,082 INFO  L140   encePairwiseOnDemand]: 102/122 looper letters, 28 selfloop transitions, 24 changer transitions 1/149 dead transitions.
[2024-03-09 06:00:46,082 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 149 transitions, 409 flow
[2024-03-09 06:00:46,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:00:46,085 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:00:46,091 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-09 06:00:46,094 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756830601092896
[2024-03-09 06:00:46,094 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-09 06:00:46,095 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-09 06:00:46,097 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:00:46,098 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-09 06:00:46,102 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 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-09 06:00:46,107 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-09 06:00:46,108 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-09 06:00:46,109 INFO  L175             Difference]: Start difference. First operand has 121 places, 122 transitions, 251 flow. Second operand 6 states and 641 transitions.
[2024-03-09 06:00:46,110 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 149 transitions, 409 flow
[2024-03-09 06:00:46,112 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 149 transitions, 409 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:00:46,115 INFO  L231             Difference]: Finished difference. Result has 131 places, 142 transitions, 421 flow
[2024-03-09 06:00:46,117 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=131, PETRI_TRANSITIONS=142}
[2024-03-09 06:00:46,119 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places.
[2024-03-09 06:00:46,120 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 421 flow
[2024-03-09 06:00:46,120 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-09 06:00:46,120 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:00:46,120 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]
[2024-03-09 06:00:46,120 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 06:00:46,121 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:00:46,121 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:00:46,121 INFO  L85        PathProgramCache]: Analyzing trace with hash -519029290, now seen corresponding path program 1 times
[2024-03-09 06:00:46,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:00:46,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154066122]
[2024-03-09 06:00:46,122 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:46,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:00:46,140 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:46,198 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-09 06:00:46,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:00:46,198 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154066122]
[2024-03-09 06:00:46,198 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154066122] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:00:46,199 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:00:46,199 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:00:46,199 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284669102]
[2024-03-09 06:00:46,199 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:00:46,200 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:00:46,200 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:00:46,200 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:00:46,201 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:00:46,262 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 122
[2024-03-09 06:00:46,263 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 142 transitions, 421 flow. Second operand  has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 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-09 06:00:46,263 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:00:46,264 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 122
[2024-03-09 06:00:46,264 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:00:46,325 INFO  L124   PetriNetUnfolderBase]: 59/485 cut-off events.
[2024-03-09 06:00:46,325 INFO  L125   PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES.
[2024-03-09 06:00:46,327 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 788 conditions, 485 events. 59/485 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2134 event pairs, 3 based on Foata normal form. 1/457 useless extension candidates. Maximal degree in co-relation 609. Up to 73 conditions per place. 
[2024-03-09 06:00:46,328 INFO  L140   encePairwiseOnDemand]: 114/122 looper letters, 11 selfloop transitions, 6 changer transitions 1/147 dead transitions.
[2024-03-09 06:00:46,329 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 467 flow
[2024-03-09 06:00:46,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:00:46,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:00:46,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions.
[2024-03-09 06:00:46,333 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.894808743169399
[2024-03-09 06:00:46,333 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 655 transitions.
[2024-03-09 06:00:46,333 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions.
[2024-03-09 06:00:46,334 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:00:46,334 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions.
[2024-03-09 06:00:46,335 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 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-09 06:00:46,337 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-09 06:00:46,337 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-09 06:00:46,337 INFO  L175             Difference]: Start difference. First operand has 131 places, 142 transitions, 421 flow. Second operand 6 states and 655 transitions.
[2024-03-09 06:00:46,337 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 467 flow
[2024-03-09 06:00:46,342 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 467 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:00:46,345 INFO  L231             Difference]: Finished difference. Result has 139 places, 146 transitions, 463 flow
[2024-03-09 06:00:46,345 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=139, PETRI_TRANSITIONS=146}
[2024-03-09 06:00:46,347 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places.
[2024-03-09 06:00:46,347 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 146 transitions, 463 flow
[2024-03-09 06:00:46,348 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 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-09 06:00:46,348 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:00:46,348 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]
[2024-03-09 06:00:46,348 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 06:00:46,348 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:00:46,349 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:00:46,349 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345010082, now seen corresponding path program 1 times
[2024-03-09 06:00:46,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:00:46,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767033456]
[2024-03-09 06:00:46,350 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:46,350 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:00:46,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:46,570 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-09 06:00:46,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:00:46,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767033456]
[2024-03-09 06:00:46,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767033456] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:00:46,572 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:00:46,572 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:00:46,573 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079243370]
[2024-03-09 06:00:46,573 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:00:46,573 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:00:46,574 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:00:46,575 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:00:46,575 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:00:46,853 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122
[2024-03-09 06:00:46,854 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 146 transitions, 463 flow. Second operand  has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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-09 06:00:46,854 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:00:46,854 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122
[2024-03-09 06:00:46,854 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:00:47,049 INFO  L124   PetriNetUnfolderBase]: 207/964 cut-off events.
[2024-03-09 06:00:47,049 INFO  L125   PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES.
[2024-03-09 06:00:47,052 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1947 conditions, 964 events. 207/964 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6047 event pairs, 9 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 1814. Up to 294 conditions per place. 
[2024-03-09 06:00:47,054 INFO  L140   encePairwiseOnDemand]: 99/122 looper letters, 51 selfloop transitions, 50 changer transitions 4/206 dead transitions.
[2024-03-09 06:00:47,054 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 206 transitions, 900 flow
[2024-03-09 06:00:47,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:00:47,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:00:47,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions.
[2024-03-09 06:00:47,057 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8415300546448088
[2024-03-09 06:00:47,057 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 616 transitions.
[2024-03-09 06:00:47,057 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions.
[2024-03-09 06:00:47,057 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:00:47,057 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions.
[2024-03-09 06:00:47,059 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 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-09 06:00:47,060 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-09 06:00:47,061 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-09 06:00:47,061 INFO  L175             Difference]: Start difference. First operand has 139 places, 146 transitions, 463 flow. Second operand 6 states and 616 transitions.
[2024-03-09 06:00:47,061 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 206 transitions, 900 flow
[2024-03-09 06:00:47,063 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 206 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:00:47,066 INFO  L231             Difference]: Finished difference. Result has 148 places, 192 transitions, 919 flow
[2024-03-09 06:00:47,066 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=148, PETRI_TRANSITIONS=192}
[2024-03-09 06:00:47,067 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 27 predicate places.
[2024-03-09 06:00:47,067 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 192 transitions, 919 flow
[2024-03-09 06:00:47,067 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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-09 06:00:47,067 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:00:47,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:00:47,068 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 06:00:47,068 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:00:47,068 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:00:47,068 INFO  L85        PathProgramCache]: Analyzing trace with hash 808891466, now seen corresponding path program 1 times
[2024-03-09 06:00:47,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:00:47,069 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169847295]
[2024-03-09 06:00:47,069 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:47,069 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:00:47,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:47,349 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-09 06:00:47,350 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:00:47,350 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169847295]
[2024-03-09 06:00:47,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169847295] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:00:47,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:00:47,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:00:47,350 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587474410]
[2024-03-09 06:00:47,350 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:00:47,351 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:00:47,351 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:00:47,351 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:00:47,351 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:00:47,482 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 122
[2024-03-09 06:00:47,483 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 192 transitions, 919 flow. Second operand  has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 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-09 06:00:47,483 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:00:47,484 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 122
[2024-03-09 06:00:47,484 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:00:47,909 INFO  L124   PetriNetUnfolderBase]: 584/1937 cut-off events.
[2024-03-09 06:00:47,909 INFO  L125   PetriNetUnfolderBase]: For 1463/1580 co-relation queries the response was YES.
[2024-03-09 06:00:47,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5122 conditions, 1937 events. 584/1937 cut-off events. For 1463/1580 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 14378 event pairs, 96 based on Foata normal form. 20/1852 useless extension candidates. Maximal degree in co-relation 4880. Up to 1013 conditions per place. 
[2024-03-09 06:00:47,919 INFO  L140   encePairwiseOnDemand]: 91/122 looper letters, 98 selfloop transitions, 123 changer transitions 3/314 dead transitions.
[2024-03-09 06:00:47,920 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 314 transitions, 1919 flow
[2024-03-09 06:00:47,920 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:00:47,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:00:47,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-09 06:00:47,922 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756830601092896
[2024-03-09 06:00:47,922 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-09 06:00:47,922 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-09 06:00:47,922 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:00:47,922 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-09 06:00:47,924 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 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-09 06:00:47,925 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-09 06:00:47,925 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-09 06:00:47,925 INFO  L175             Difference]: Start difference. First operand has 148 places, 192 transitions, 919 flow. Second operand 6 states and 641 transitions.
[2024-03-09 06:00:47,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 314 transitions, 1919 flow
[2024-03-09 06:00:47,933 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 314 transitions, 1907 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 06:00:47,937 INFO  L231             Difference]: Finished difference. Result has 151 places, 311 transitions, 2033 flow
[2024-03-09 06:00:47,937 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2033, PETRI_PLACES=151, PETRI_TRANSITIONS=311}
[2024-03-09 06:00:47,938 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 30 predicate places.
[2024-03-09 06:00:47,938 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 311 transitions, 2033 flow
[2024-03-09 06:00:47,938 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 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-09 06:00:47,938 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:00:47,938 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:00:47,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 06:00:47,939 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:00:47,939 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:00:47,939 INFO  L85        PathProgramCache]: Analyzing trace with hash 868130232, now seen corresponding path program 1 times
[2024-03-09 06:00:47,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:00:47,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511979711]
[2024-03-09 06:00:47,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:47,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:00:47,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:48,382 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:00:48,382 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:00:48,382 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511979711]
[2024-03-09 06:00:48,382 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511979711] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:00:48,382 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753236957]
[2024-03-09 06:00:48,383 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:48,383 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:00:48,383 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:00:48,384 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-09 06:00:48,387 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-09 06:00:48,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:48,511 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-03-09 06:00:48,521 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:00:48,559 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-09 06:00:48,592 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:00:48,592 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 06:00:48,608 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 16 treesize of output 8
[2024-03-09 06:00:48,647 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:00:48,658 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 21 treesize of output 20
[2024-03-09 06:00:48,673 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:00:48,673 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 06:00:48,694 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:00:48,695 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 06:00:48,839 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 43 treesize of output 32
[2024-03-09 06:00:48,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:00:48,849 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:00:48,876 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-09 06:00:49,004 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset))) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-09 06:00:49,020 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-09 06:00:49,108 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-09 06:00:49,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-03-09 06:00:49,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753236957] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:00:49,141 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:00:49,141 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18
[2024-03-09 06:00:49,141 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763745145]
[2024-03-09 06:00:49,141 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:00:49,142 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-03-09 06:00:49,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:00:49,143 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-03-09 06:00:49,143 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=202, Unknown=3, NotChecked=90, Total=342
[2024-03-09 06:00:49,144 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 47 out of 122
[2024-03-09 06:00:49,145 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 311 transitions, 2033 flow. Second operand  has 19 states, 19 states have (on average 49.421052631578945) internal successors, (939), 19 states have internal predecessors, (939), 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-09 06:00:49,145 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:00:49,145 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 122
[2024-03-09 06:00:49,145 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:00:51,732 INFO  L124   PetriNetUnfolderBase]: 1144/3013 cut-off events.
[2024-03-09 06:00:51,732 INFO  L125   PetriNetUnfolderBase]: For 4425/4425 co-relation queries the response was YES.
[2024-03-09 06:00:51,738 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10384 conditions, 3013 events. 1144/3013 cut-off events. For 4425/4425 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 21994 event pairs, 66 based on Foata normal form. 39/3014 useless extension candidates. Maximal degree in co-relation 10101. Up to 993 conditions per place. 
[2024-03-09 06:00:51,747 INFO  L140   encePairwiseOnDemand]: 87/122 looper letters, 395 selfloop transitions, 176 changer transitions 52/670 dead transitions.
[2024-03-09 06:00:51,747 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 670 transitions, 5213 flow
[2024-03-09 06:00:51,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-03-09 06:00:51,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-03-09 06:00:51,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1820 transitions.
[2024-03-09 06:00:51,751 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4972677595628415
[2024-03-09 06:00:51,751 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 1820 transitions.
[2024-03-09 06:00:51,751 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 1820 transitions.
[2024-03-09 06:00:51,752 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:00:51,753 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1820 transitions.
[2024-03-09 06:00:51,756 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 60.666666666666664) internal successors, (1820), 30 states have internal predecessors, (1820), 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-09 06:00:51,760 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 122.0) internal successors, (3782), 31 states have internal predecessors, (3782), 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-09 06:00:51,761 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 122.0) internal successors, (3782), 31 states have internal predecessors, (3782), 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-09 06:00:51,761 INFO  L175             Difference]: Start difference. First operand has 151 places, 311 transitions, 2033 flow. Second operand 30 states and 1820 transitions.
[2024-03-09 06:00:51,761 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 670 transitions, 5213 flow
[2024-03-09 06:00:51,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 670 transitions, 5123 flow, removed 45 selfloop flow, removed 0 redundant places.
[2024-03-09 06:00:51,790 INFO  L231             Difference]: Finished difference. Result has 194 places, 386 transitions, 3205 flow
[2024-03-09 06:00:51,790 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3205, PETRI_PLACES=194, PETRI_TRANSITIONS=386}
[2024-03-09 06:00:51,791 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 73 predicate places.
[2024-03-09 06:00:51,791 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 386 transitions, 3205 flow
[2024-03-09 06:00:51,792 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 49.421052631578945) internal successors, (939), 19 states have internal predecessors, (939), 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-09 06:00:51,792 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:00:51,792 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:00:51,799 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-03-09 06:00:51,999 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:00:52,000 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:00:52,001 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:00:52,001 INFO  L85        PathProgramCache]: Analyzing trace with hash 1834197211, now seen corresponding path program 1 times
[2024-03-09 06:00:52,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:00:52,001 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730558437]
[2024-03-09 06:00:52,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:52,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:00:52,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:52,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:00:52,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:00:52,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730558437]
[2024-03-09 06:00:52,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730558437] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:00:52,499 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720582921]
[2024-03-09 06:00:52,499 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:52,499 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:00:52,499 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:00:52,500 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-09 06:00:52,506 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-09 06:00:52,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:52,592 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-09 06:00:52,594 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:00:52,605 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-09 06:00:52,651 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:00:52,651 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 06:00:52,702 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 16 treesize of output 8
[2024-03-09 06:00:52,850 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:00:52,886 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:00:52,939 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:00:52,983 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:00:53,113 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 37 treesize of output 26
[2024-03-09 06:00:53,151 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:00:53,151 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:00:53,173 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)))) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false
[2024-03-09 06:00:53,248 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))) is different from false
[2024-03-09 06:00:53,273 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))))) is different from false
[2024-03-09 06:00:53,293 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0))))) is different from false
[2024-03-09 06:00:53,397 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-09 06:00:53,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-09 06:00:53,420 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720582921] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:00:53,420 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:00:53,420 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30
[2024-03-09 06:00:53,420 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687562355]
[2024-03-09 06:00:53,420 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:00:53,421 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-03-09 06:00:53,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:00:53,422 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-03-09 06:00:53,422 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=605, Unknown=4, NotChecked=212, Total=930
[2024-03-09 06:00:53,492 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 122
[2024-03-09 06:00:53,494 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 386 transitions, 3205 flow. Second operand  has 31 states, 31 states have (on average 52.29032258064516) internal successors, (1621), 31 states have internal predecessors, (1621), 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-09 06:00:53,494 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:00:53,494 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 122
[2024-03-09 06:00:53,494 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:00:55,161 INFO  L124   PetriNetUnfolderBase]: 934/2711 cut-off events.
[2024-03-09 06:00:55,161 INFO  L125   PetriNetUnfolderBase]: For 8899/8902 co-relation queries the response was YES.
[2024-03-09 06:00:55,167 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11193 conditions, 2711 events. 934/2711 cut-off events. For 8899/8902 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20082 event pairs, 111 based on Foata normal form. 25/2685 useless extension candidates. Maximal degree in co-relation 10881. Up to 1242 conditions per place. 
[2024-03-09 06:00:55,176 INFO  L140   encePairwiseOnDemand]: 107/122 looper letters, 378 selfloop transitions, 34 changer transitions 28/493 dead transitions.
[2024-03-09 06:00:55,176 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 493 transitions, 4659 flow
[2024-03-09 06:00:55,176 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-09 06:00:55,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-09 06:00:55,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1088 transitions.
[2024-03-09 06:00:55,179 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49544626593806923
[2024-03-09 06:00:55,179 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1088 transitions.
[2024-03-09 06:00:55,179 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1088 transitions.
[2024-03-09 06:00:55,179 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:00:55,179 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1088 transitions.
[2024-03-09 06:00:55,181 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 60.44444444444444) internal successors, (1088), 18 states have internal predecessors, (1088), 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-09 06:00:55,183 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 122.0) internal successors, (2318), 19 states have internal predecessors, (2318), 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-09 06:00:55,184 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 122.0) internal successors, (2318), 19 states have internal predecessors, (2318), 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-09 06:00:55,184 INFO  L175             Difference]: Start difference. First operand has 194 places, 386 transitions, 3205 flow. Second operand 18 states and 1088 transitions.
[2024-03-09 06:00:55,184 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 493 transitions, 4659 flow
[2024-03-09 06:00:55,223 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 493 transitions, 4607 flow, removed 9 selfloop flow, removed 9 redundant places.
[2024-03-09 06:00:55,228 INFO  L231             Difference]: Finished difference. Result has 200 places, 370 transitions, 3051 flow
[2024-03-09 06:00:55,228 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=3149, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3051, PETRI_PLACES=200, PETRI_TRANSITIONS=370}
[2024-03-09 06:00:55,229 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 79 predicate places.
[2024-03-09 06:00:55,229 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 370 transitions, 3051 flow
[2024-03-09 06:00:55,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 52.29032258064516) internal successors, (1621), 31 states have internal predecessors, (1621), 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-09 06:00:55,230 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:00:55,230 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, 1, 1, 1, 1, 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-09 06:00:55,237 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-03-09 06:00:55,431 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,SelfDestructingSolverStorable5
[2024-03-09 06:00:55,432 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:00:55,432 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:00:55,433 INFO  L85        PathProgramCache]: Analyzing trace with hash -1693408392, now seen corresponding path program 1 times
[2024-03-09 06:00:55,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:00:55,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346519489]
[2024-03-09 06:00:55,433 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:55,434 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:00:55,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:55,654 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-09 06:00:55,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:00:55,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346519489]
[2024-03-09 06:00:55,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346519489] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:00:55,654 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:00:55,654 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:00:55,654 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340739884]
[2024-03-09 06:00:55,655 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:00:55,655 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:00:55,655 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:00:55,655 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:00:55,655 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:00:55,980 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122
[2024-03-09 06:00:55,981 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 370 transitions, 3051 flow. Second operand  has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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-09 06:00:55,981 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:00:55,981 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122
[2024-03-09 06:00:55,981 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:00:56,243 INFO  L124   PetriNetUnfolderBase]: 520/1890 cut-off events.
[2024-03-09 06:00:56,243 INFO  L125   PetriNetUnfolderBase]: For 6325/6372 co-relation queries the response was YES.
[2024-03-09 06:00:56,249 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 1890 events. 520/1890 cut-off events. For 6325/6372 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14555 event pairs, 42 based on Foata normal form. 5/1874 useless extension candidates. Maximal degree in co-relation 7163. Up to 474 conditions per place. 
[2024-03-09 06:00:56,254 INFO  L140   encePairwiseOnDemand]: 111/122 looper letters, 120 selfloop transitions, 37 changer transitions 15/410 dead transitions.
[2024-03-09 06:00:56,254 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 410 transitions, 3815 flow
[2024-03-09 06:00:56,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:00:56,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:00:56,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions.
[2024-03-09 06:00:56,256 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8770491803278688
[2024-03-09 06:00:56,256 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 642 transitions.
[2024-03-09 06:00:56,256 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions.
[2024-03-09 06:00:56,257 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:00:56,257 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions.
[2024-03-09 06:00:56,258 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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-09 06:00:56,259 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-09 06:00:56,259 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-09 06:00:56,259 INFO  L175             Difference]: Start difference. First operand has 200 places, 370 transitions, 3051 flow. Second operand 6 states and 642 transitions.
[2024-03-09 06:00:56,259 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 410 transitions, 3815 flow
[2024-03-09 06:00:56,288 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 410 transitions, 3748 flow, removed 1 selfloop flow, removed 16 redundant places.
[2024-03-09 06:00:56,293 INFO  L231             Difference]: Finished difference. Result has 194 places, 395 transitions, 3496 flow
[2024-03-09 06:00:56,293 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=2984, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3496, PETRI_PLACES=194, PETRI_TRANSITIONS=395}
[2024-03-09 06:00:56,294 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 73 predicate places.
[2024-03-09 06:00:56,294 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 395 transitions, 3496 flow
[2024-03-09 06:00:56,294 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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-09 06:00:56,294 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:00:56,294 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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]
[2024-03-09 06:00:56,295 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 06:00:56,295 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:00:56,295 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:00:56,295 INFO  L85        PathProgramCache]: Analyzing trace with hash 2045064484, now seen corresponding path program 1 times
[2024-03-09 06:00:56,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:00:56,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351191880]
[2024-03-09 06:00:56,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:56,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:00:56,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:00:56,325 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:00:56,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:00:56,352 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:00:56,353 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:00:56,353 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-03-09 06:00:56,355 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-09 06:00:56,355 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-09 06:00:56,355 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-09 06:00:56,355 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-09 06:00:56,355 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-03-09 06:00:56,355 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-09 06:00:56,356 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-09 06:00:56,356 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-09 06:00:56,356 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 06:00:56,356 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:00:56,358 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:00:56,358 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 06:00:56,372 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 06:00:56,374 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 140 transitions, 296 flow
[2024-03-09 06:00:56,392 INFO  L124   PetriNetUnfolderBase]: 11/335 cut-off events.
[2024-03-09 06:00:56,392 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-09 06:00:56,392 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 347 conditions, 335 events. 11/335 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 768 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 190. Up to 8 conditions per place. 
[2024-03-09 06:00:56,392 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 140 transitions, 296 flow
[2024-03-09 06:00:56,393 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 140 places, 140 transitions, 296 flow
[2024-03-09 06:00:56,394 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:00:56,395 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;@15fe4d58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:00:56,395 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-03-09 06:00:56,397 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:00:56,397 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-03-09 06:00:56,397 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:00:56,397 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:00:56,397 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]
[2024-03-09 06:00:56,398 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:00:56,398 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:00:56,398 INFO  L85        PathProgramCache]: Analyzing trace with hash -2031979688, now seen corresponding path program 1 times
[2024-03-09 06:00:56,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:00:56,398 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146494076]
[2024-03-09 06:00:56,398 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:56,398 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:00:56,405 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:56,529 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-09 06:00:56,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:00:56,529 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146494076]
[2024-03-09 06:00:56,529 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146494076] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:00:56,530 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:00:56,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:00:56,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116206473]
[2024-03-09 06:00:56,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:00:56,530 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:00:56,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:00:56,530 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:00:56,531 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:00:56,790 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140
[2024-03-09 06:00:56,791 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 296 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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-09 06:00:56,791 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:00:56,791 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140
[2024-03-09 06:00:56,791 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:00:57,189 INFO  L124   PetriNetUnfolderBase]: 1139/4013 cut-off events.
[2024-03-09 06:00:57,189 INFO  L125   PetriNetUnfolderBase]: For 132/220 co-relation queries the response was YES.
[2024-03-09 06:00:57,193 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 4013 events. 1139/4013 cut-off events. For 132/220 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 31918 event pairs, 192 based on Foata normal form. 74/3754 useless extension candidates. Maximal degree in co-relation 2969. Up to 1538 conditions per place. 
[2024-03-09 06:00:57,203 INFO  L140   encePairwiseOnDemand]: 116/140 looper letters, 36 selfloop transitions, 43 changer transitions 1/188 dead transitions.
[2024-03-09 06:00:57,203 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 188 transitions, 558 flow
[2024-03-09 06:00:57,208 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:00:57,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:00:57,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions.
[2024-03-09 06:00:57,210 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8809523809523809
[2024-03-09 06:00:57,210 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 740 transitions.
[2024-03-09 06:00:57,210 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions.
[2024-03-09 06:00:57,210 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:00:57,210 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions.
[2024-03-09 06:00:57,212 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 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-09 06:00:57,213 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-09 06:00:57,214 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-09 06:00:57,214 INFO  L175             Difference]: Start difference. First operand has 140 places, 140 transitions, 296 flow. Second operand 6 states and 740 transitions.
[2024-03-09 06:00:57,214 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 188 transitions, 558 flow
[2024-03-09 06:00:57,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 188 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:00:57,218 INFO  L231             Difference]: Finished difference. Result has 150 places, 179 transitions, 588 flow
[2024-03-09 06:00:57,218 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=150, PETRI_TRANSITIONS=179}
[2024-03-09 06:00:57,219 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 10 predicate places.
[2024-03-09 06:00:57,219 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 179 transitions, 588 flow
[2024-03-09 06:00:57,220 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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-09 06:00:57,220 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:00:57,220 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]
[2024-03-09 06:00:57,220 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 06:00:57,220 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:00:57,221 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:00:57,221 INFO  L85        PathProgramCache]: Analyzing trace with hash -28367262, now seen corresponding path program 1 times
[2024-03-09 06:00:57,221 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:00:57,221 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356577919]
[2024-03-09 06:00:57,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:57,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:00:57,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:57,265 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-09 06:00:57,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:00:57,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356577919]
[2024-03-09 06:00:57,266 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356577919] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:00:57,266 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:00:57,266 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:00:57,266 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452233636]
[2024-03-09 06:00:57,266 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:00:57,266 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:00:57,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:00:57,267 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:00:57,267 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:00:57,331 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140
[2024-03-09 06:00:57,332 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 179 transitions, 588 flow. Second operand  has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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-09 06:00:57,332 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:00:57,332 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140
[2024-03-09 06:00:57,332 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:00:57,591 INFO  L124   PetriNetUnfolderBase]: 890/3527 cut-off events.
[2024-03-09 06:00:57,591 INFO  L125   PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES.
[2024-03-09 06:00:57,598 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6149 conditions, 3527 events. 890/3527 cut-off events. For 563/567 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 28494 event pairs, 150 based on Foata normal form. 1/3305 useless extension candidates. Maximal degree in co-relation 3349. Up to 983 conditions per place. 
[2024-03-09 06:00:57,606 INFO  L140   encePairwiseOnDemand]: 132/140 looper letters, 14 selfloop transitions, 6 changer transitions 1/185 dead transitions.
[2024-03-09 06:00:57,606 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 185 transitions, 642 flow
[2024-03-09 06:00:57,608 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:00:57,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:00:57,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions.
[2024-03-09 06:00:57,610 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8976190476190476
[2024-03-09 06:00:57,610 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 754 transitions.
[2024-03-09 06:00:57,610 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions.
[2024-03-09 06:00:57,610 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:00:57,610 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions.
[2024-03-09 06:00:57,612 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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-09 06:00:57,613 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-09 06:00:57,613 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-09 06:00:57,613 INFO  L175             Difference]: Start difference. First operand has 150 places, 179 transitions, 588 flow. Second operand 6 states and 754 transitions.
[2024-03-09 06:00:57,613 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 185 transitions, 642 flow
[2024-03-09 06:00:57,617 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 185 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:00:57,635 INFO  L231             Difference]: Finished difference. Result has 158 places, 184 transitions, 634 flow
[2024-03-09 06:00:57,636 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=158, PETRI_TRANSITIONS=184}
[2024-03-09 06:00:57,636 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 18 predicate places.
[2024-03-09 06:00:57,636 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 184 transitions, 634 flow
[2024-03-09 06:00:57,637 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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-09 06:00:57,637 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:00:57,637 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]
[2024-03-09 06:00:57,637 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 06:00:57,637 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:00:57,637 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:00:57,637 INFO  L85        PathProgramCache]: Analyzing trace with hash -624336094, now seen corresponding path program 1 times
[2024-03-09 06:00:57,637 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:00:57,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063962162]
[2024-03-09 06:00:57,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:57,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:00:57,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:57,768 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-09 06:00:57,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:00:57,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063962162]
[2024-03-09 06:00:57,768 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063962162] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:00:57,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:00:57,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:00:57,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248578699]
[2024-03-09 06:00:57,769 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:00:57,769 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:00:57,769 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:00:57,769 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:00:57,770 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:00:57,998 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140
[2024-03-09 06:00:57,999 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 184 transitions, 634 flow. Second operand  has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 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-09 06:00:57,999 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:00:57,999 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140
[2024-03-09 06:00:57,999 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:00:58,954 INFO  L124   PetriNetUnfolderBase]: 3173/8714 cut-off events.
[2024-03-09 06:00:58,954 INFO  L125   PetriNetUnfolderBase]: For 4364/4375 co-relation queries the response was YES.
[2024-03-09 06:00:58,967 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19459 conditions, 8714 events. 3173/8714 cut-off events. For 4364/4375 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 76201 event pairs, 410 based on Foata normal form. 7/8209 useless extension candidates. Maximal degree in co-relation 19325. Up to 3775 conditions per place. 
[2024-03-09 06:00:58,986 INFO  L140   encePairwiseOnDemand]: 113/140 looper letters, 78 selfloop transitions, 104 changer transitions 4/300 dead transitions.
[2024-03-09 06:00:58,987 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 300 transitions, 1529 flow
[2024-03-09 06:00:58,987 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:00:58,988 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:00:58,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions.
[2024-03-09 06:00:58,989 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8511904761904762
[2024-03-09 06:00:58,989 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 715 transitions.
[2024-03-09 06:00:58,989 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions.
[2024-03-09 06:00:58,989 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:00:58,989 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions.
[2024-03-09 06:00:58,990 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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-09 06:00:58,991 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-09 06:00:58,992 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-09 06:00:58,992 INFO  L175             Difference]: Start difference. First operand has 158 places, 184 transitions, 634 flow. Second operand 6 states and 715 transitions.
[2024-03-09 06:00:58,992 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 300 transitions, 1529 flow
[2024-03-09 06:00:58,997 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 300 transitions, 1527 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:00:59,000 INFO  L231             Difference]: Finished difference. Result has 167 places, 284 transitions, 1638 flow
[2024-03-09 06:00:59,000 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1638, PETRI_PLACES=167, PETRI_TRANSITIONS=284}
[2024-03-09 06:00:59,001 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 27 predicate places.
[2024-03-09 06:00:59,001 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 284 transitions, 1638 flow
[2024-03-09 06:00:59,001 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 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-09 06:00:59,001 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:00:59,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:00:59,001 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 06:00:59,001 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:00:59,002 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:00:59,002 INFO  L85        PathProgramCache]: Analyzing trace with hash 737051974, now seen corresponding path program 1 times
[2024-03-09 06:00:59,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:00:59,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999842823]
[2024-03-09 06:00:59,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:00:59,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:00:59,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:00:59,196 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-09 06:00:59,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:00:59,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999842823]
[2024-03-09 06:00:59,197 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999842823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:00:59,197 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:00:59,197 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:00:59,197 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807437190]
[2024-03-09 06:00:59,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:00:59,197 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:00:59,197 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:00:59,198 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:00:59,198 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:00:59,329 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140
[2024-03-09 06:00:59,330 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 284 transitions, 1638 flow. Second operand  has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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-09 06:00:59,330 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:00:59,330 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140
[2024-03-09 06:00:59,330 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:01:01,788 INFO  L124   PetriNetUnfolderBase]: 8591/20092 cut-off events.
[2024-03-09 06:01:01,788 INFO  L125   PetriNetUnfolderBase]: For 22443/24839 co-relation queries the response was YES.
[2024-03-09 06:01:01,828 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58977 conditions, 20092 events. 8591/20092 cut-off events. For 22443/24839 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 189899 event pairs, 1805 based on Foata normal form. 70/19084 useless extension candidates. Maximal degree in co-relation 20664. Up to 11843 conditions per place. 
[2024-03-09 06:01:01,889 INFO  L140   encePairwiseOnDemand]: 105/140 looper letters, 173 selfloop transitions, 249 changer transitions 0/525 dead transitions.
[2024-03-09 06:01:01,889 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 525 transitions, 3950 flow
[2024-03-09 06:01:01,890 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:01:01,890 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:01:01,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions.
[2024-03-09 06:01:01,892 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8845238095238095
[2024-03-09 06:01:01,892 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 743 transitions.
[2024-03-09 06:01:01,892 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions.
[2024-03-09 06:01:01,892 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:01:01,892 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions.
[2024-03-09 06:01:01,893 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 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-09 06:01:01,894 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-09 06:01:01,895 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-09 06:01:01,895 INFO  L175             Difference]: Start difference. First operand has 167 places, 284 transitions, 1638 flow. Second operand 6 states and 743 transitions.
[2024-03-09 06:01:01,895 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 525 transitions, 3950 flow
[2024-03-09 06:01:01,922 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 525 transitions, 3940 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-09 06:01:01,927 INFO  L231             Difference]: Finished difference. Result has 171 places, 517 transitions, 4284 flow
[2024-03-09 06:01:01,927 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4284, PETRI_PLACES=171, PETRI_TRANSITIONS=517}
[2024-03-09 06:01:01,927 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 31 predicate places.
[2024-03-09 06:01:01,927 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 517 transitions, 4284 flow
[2024-03-09 06:01:01,928 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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-09 06:01:01,928 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:01:01,928 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:01:01,928 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-09 06:01:01,928 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:01:01,928 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:01:01,928 INFO  L85        PathProgramCache]: Analyzing trace with hash 2127204244, now seen corresponding path program 1 times
[2024-03-09 06:01:01,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:01:01,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265523527]
[2024-03-09 06:01:01,929 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:01:01,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:01:01,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:01:02,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:01:02,231 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:01:02,231 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265523527]
[2024-03-09 06:01:02,231 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265523527] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:01:02,231 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510566499]
[2024-03-09 06:01:02,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:01:02,232 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:01:02,232 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:01:02,233 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-09 06:01:02,235 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-09 06:01:02,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:01:02,387 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core
[2024-03-09 06:01:02,400 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:01:02,456 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-09 06:01:02,563 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 11 treesize of output 7
[2024-03-09 06:01:02,587 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20
[2024-03-09 06:01:02,617 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:01:02,617 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 06:01:02,650 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:01:02,650 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 34 treesize of output 25
[2024-03-09 06:01:02,661 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:01:02,661 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 06:01:02,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:01:02,669 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:01:02,746 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_578 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_578) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_578 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_578) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_578 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_578) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-09 06:01:02,867 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 15 treesize of output 7
[2024-03-09 06:01:02,906 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:01:02,906 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [510566499] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:01:02,906 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:01:02,906 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31
[2024-03-09 06:01:02,909 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729666708]
[2024-03-09 06:01:02,909 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:01:02,910 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-03-09 06:01:02,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:01:02,912 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-03-09 06:01:02,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=821, Unknown=8, NotChecked=58, Total=992
[2024-03-09 06:01:02,915 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 140
[2024-03-09 06:01:02,916 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 517 transitions, 4284 flow. Second operand  has 32 states, 32 states have (on average 58.78125) internal successors, (1881), 32 states have internal predecessors, (1881), 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-09 06:01:02,916 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:01:02,916 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 140
[2024-03-09 06:01:02,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:01:12,678 INFO  L124   PetriNetUnfolderBase]: 27291/52140 cut-off events.
[2024-03-09 06:01:12,679 INFO  L125   PetriNetUnfolderBase]: For 94321/94366 co-relation queries the response was YES.
[2024-03-09 06:01:12,810 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 182318 conditions, 52140 events. 27291/52140 cut-off events. For 94321/94366 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 492786 event pairs, 6005 based on Foata normal form. 393/49891 useless extension candidates. Maximal degree in co-relation 121077. Up to 20653 conditions per place. 
[2024-03-09 06:01:12,980 INFO  L140   encePairwiseOnDemand]: 101/140 looper letters, 849 selfloop transitions, 666 changer transitions 2/1574 dead transitions.
[2024-03-09 06:01:12,980 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1574 transitions, 15804 flow
[2024-03-09 06:01:12,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-03-09 06:01:12,981 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2024-03-09 06:01:12,984 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2299 transitions.
[2024-03-09 06:01:12,985 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5297235023041474
[2024-03-09 06:01:12,985 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2299 transitions.
[2024-03-09 06:01:12,985 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2299 transitions.
[2024-03-09 06:01:12,986 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:01:12,986 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2299 transitions.
[2024-03-09 06:01:12,989 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 74.16129032258064) internal successors, (2299), 31 states have internal predecessors, (2299), 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-09 06:01:12,994 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 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-09 06:01:12,995 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 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-09 06:01:12,995 INFO  L175             Difference]: Start difference. First operand has 171 places, 517 transitions, 4284 flow. Second operand 31 states and 2299 transitions.
[2024-03-09 06:01:12,995 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1574 transitions, 15804 flow
[2024-03-09 06:01:13,715 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 1574 transitions, 15714 flow, removed 45 selfloop flow, removed 0 redundant places.
[2024-03-09 06:01:13,729 INFO  L231             Difference]: Finished difference. Result has 223 places, 1101 transitions, 13074 flow
[2024-03-09 06:01:13,729 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=4194, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=13074, PETRI_PLACES=223, PETRI_TRANSITIONS=1101}
[2024-03-09 06:01:13,730 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 83 predicate places.
[2024-03-09 06:01:13,730 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 1101 transitions, 13074 flow
[2024-03-09 06:01:13,731 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 58.78125) internal successors, (1881), 32 states have internal predecessors, (1881), 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-09 06:01:13,731 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:01:13,731 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:01:13,739 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-09 06:01:13,931 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:01:13,932 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:01:13,933 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:01:13,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -273956613, now seen corresponding path program 1 times
[2024-03-09 06:01:13,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:01:13,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151408179]
[2024-03-09 06:01:13,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:01:13,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:01:13,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:01:14,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:01:14,272 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:01:14,272 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151408179]
[2024-03-09 06:01:14,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151408179] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:01:14,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052003085]
[2024-03-09 06:01:14,273 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:01:14,273 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:01:14,273 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:01:14,274 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-09 06:01:14,275 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-09 06:01:14,416 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:01:14,418 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-03-09 06:01:14,423 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:01:14,429 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-09 06:01:14,460 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:01:14,461 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-09 06:01:14,514 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 16 treesize of output 8
[2024-03-09 06:01:14,659 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:01:14,689 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:01:14,721 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:01:14,768 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:01:14,810 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 37 treesize of output 26
[2024-03-09 06:01:14,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:01:14,841 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:01:14,858 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false
[2024-03-09 06:01:14,870 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))))) is different from false
[2024-03-09 06:01:14,883 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)))) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0))))) is different from false
[2024-03-09 06:01:15,048 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-09 06:01:15,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-09 06:01:15,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052003085] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:01:15,079 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:01:15,079 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29
[2024-03-09 06:01:15,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162812056]
[2024-03-09 06:01:15,079 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:01:15,080 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-09 06:01:15,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:01:15,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-09 06:01:15,081 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=607, Unknown=3, NotChecked=156, Total=870
[2024-03-09 06:01:15,176 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 140
[2024-03-09 06:01:15,177 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1101 transitions, 13074 flow. Second operand  has 30 states, 30 states have (on average 61.3) internal successors, (1839), 30 states have internal predecessors, (1839), 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-09 06:01:15,177 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:01:15,177 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 140
[2024-03-09 06:01:15,177 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:01:28,710 INFO  L124   PetriNetUnfolderBase]: 28482/54111 cut-off events.
[2024-03-09 06:01:28,710 INFO  L125   PetriNetUnfolderBase]: For 211116/211141 co-relation queries the response was YES.
[2024-03-09 06:01:28,990 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 238717 conditions, 54111 events. 28482/54111 cut-off events. For 211116/211141 co-relation queries the response was YES. Maximal size of possible extension queue 1511. Compared 502232 event pairs, 4801 based on Foata normal form. 256/51423 useless extension candidates. Maximal degree in co-relation 233209. Up to 15898 conditions per place. 
[2024-03-09 06:01:29,193 INFO  L140   encePairwiseOnDemand]: 112/140 looper letters, 1325 selfloop transitions, 813 changer transitions 0/2205 dead transitions.
[2024-03-09 06:01:29,193 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2205 transitions, 28069 flow
[2024-03-09 06:01:29,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-03-09 06:01:29,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-03-09 06:01:29,196 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2293 transitions.
[2024-03-09 06:01:29,196 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.545952380952381
[2024-03-09 06:01:29,197 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 2293 transitions.
[2024-03-09 06:01:29,197 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 2293 transitions.
[2024-03-09 06:01:29,197 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:01:29,197 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2293 transitions.
[2024-03-09 06:01:29,200 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 76.43333333333334) internal successors, (2293), 30 states have internal predecessors, (2293), 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-09 06:01:29,203 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 140.0) internal successors, (4340), 31 states have internal predecessors, (4340), 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-09 06:01:29,204 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 140.0) internal successors, (4340), 31 states have internal predecessors, (4340), 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-09 06:01:29,204 INFO  L175             Difference]: Start difference. First operand has 223 places, 1101 transitions, 13074 flow. Second operand 30 states and 2293 transitions.
[2024-03-09 06:01:29,204 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 2205 transitions, 28069 flow
[2024-03-09 06:01:34,347 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 2205 transitions, 27976 flow, removed 42 selfloop flow, removed 4 redundant places.
[2024-03-09 06:01:34,370 INFO  L231             Difference]: Finished difference. Result has 264 places, 1515 transitions, 21501 flow
[2024-03-09 06:01:34,371 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=12982, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=467, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=21501, PETRI_PLACES=264, PETRI_TRANSITIONS=1515}
[2024-03-09 06:01:34,371 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 124 predicate places.
[2024-03-09 06:01:34,371 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 1515 transitions, 21501 flow
[2024-03-09 06:01:34,372 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 61.3) internal successors, (1839), 30 states have internal predecessors, (1839), 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-09 06:01:34,372 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:01:34,373 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, 1, 1, 1, 1, 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-09 06:01:34,382 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-09 06:01:34,573 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,SelfDestructingSolverStorable13
[2024-03-09 06:01:34,573 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:01:34,574 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:01:34,574 INFO  L85        PathProgramCache]: Analyzing trace with hash -29121676, now seen corresponding path program 1 times
[2024-03-09 06:01:34,574 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:01:34,574 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930140241]
[2024-03-09 06:01:34,574 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:01:34,575 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:01:34,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:01:34,769 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-09 06:01:34,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:01:34,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930140241]
[2024-03-09 06:01:34,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930140241] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:01:34,770 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:01:34,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:01:34,770 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268420387]
[2024-03-09 06:01:34,770 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:01:34,770 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:01:34,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:01:34,771 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:01:34,771 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:01:35,101 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140
[2024-03-09 06:01:35,102 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1515 transitions, 21501 flow. Second operand  has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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-09 06:01:35,102 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:01:35,102 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140
[2024-03-09 06:01:35,102 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:01:40,882 INFO  L124   PetriNetUnfolderBase]: 12018/27756 cut-off events.
[2024-03-09 06:01:40,882 INFO  L125   PetriNetUnfolderBase]: For 161340/163246 co-relation queries the response was YES.
[2024-03-09 06:01:41,024 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 135777 conditions, 27756 events. 12018/27756 cut-off events. For 161340/163246 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 270310 event pairs, 939 based on Foata normal form. 183/27061 useless extension candidates. Maximal degree in co-relation 134775. Up to 10884 conditions per place. 
[2024-03-09 06:01:41,135 INFO  L140   encePairwiseOnDemand]: 125/140 looper letters, 1129 selfloop transitions, 180 changer transitions 0/1692 dead transitions.
[2024-03-09 06:01:41,135 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1692 transitions, 26542 flow
[2024-03-09 06:01:41,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:01:41,136 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:01:41,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions.
[2024-03-09 06:01:41,137 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8773809523809524
[2024-03-09 06:01:41,137 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 737 transitions.
[2024-03-09 06:01:41,137 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions.
[2024-03-09 06:01:41,137 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:01:41,137 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions.
[2024-03-09 06:01:41,138 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 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-09 06:01:41,138 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-09 06:01:41,139 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-09 06:01:41,139 INFO  L175             Difference]: Start difference. First operand has 264 places, 1515 transitions, 21501 flow. Second operand 6 states and 737 transitions.
[2024-03-09 06:01:41,139 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1692 transitions, 26542 flow
[2024-03-09 06:01:42,924 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1692 transitions, 26334 flow, removed 82 selfloop flow, removed 10 redundant places.
[2024-03-09 06:01:42,946 INFO  L231             Difference]: Finished difference. Result has 264 places, 1690 transitions, 24551 flow
[2024-03-09 06:01:42,947 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=21293, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24551, PETRI_PLACES=264, PETRI_TRANSITIONS=1690}
[2024-03-09 06:01:42,947 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 124 predicate places.
[2024-03-09 06:01:42,947 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 1690 transitions, 24551 flow
[2024-03-09 06:01:42,948 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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-09 06:01:42,948 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:01:42,948 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, 1, 1, 1, 1, 1, 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-09 06:01:42,948 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-09 06:01:42,948 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:01:42,948 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:01:42,948 INFO  L85        PathProgramCache]: Analyzing trace with hash 1272654483, now seen corresponding path program 1 times
[2024-03-09 06:01:42,949 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:01:42,949 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045364688]
[2024-03-09 06:01:42,949 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:01:42,949 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:01:42,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:01:43,234 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-09 06:01:43,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:01:43,234 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045364688]
[2024-03-09 06:01:43,234 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045364688] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:01:43,234 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189579843]
[2024-03-09 06:01:43,235 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:01:43,235 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:01:43,235 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:01:43,236 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-09 06:01:43,241 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-09 06:01:43,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:01:43,367 INFO  L262         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core
[2024-03-09 06:01:43,370 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:01:43,418 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-09 06:01:43,516 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 11 treesize of output 7
[2024-03-09 06:01:43,545 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20
[2024-03-09 06:01:43,581 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:01:43,582 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 06:01:43,622 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:01:43,622 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 06:01:43,672 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:01:43,673 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 43 treesize of output 32
[2024-03-09 06:01:43,683 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-09 06:01:43,683 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:01:43,702 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_822 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-09 06:01:43,718 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-09 06:01:43,735 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_822 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_822) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-09 06:01:43,906 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 15 treesize of output 7
[2024-03-09 06:01:43,949 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-09 06:01:43,949 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [189579843] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:01:43,949 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:01:43,949 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32
[2024-03-09 06:01:43,950 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160855212]
[2024-03-09 06:01:43,950 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:01:43,950 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2024-03-09 06:01:43,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:01:43,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2024-03-09 06:01:43,951 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=763, Unknown=3, NotChecked=174, Total=1056
[2024-03-09 06:01:44,088 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 140
[2024-03-09 06:01:44,089 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1690 transitions, 24551 flow. Second operand  has 33 states, 33 states have (on average 60.75757575757576) internal successors, (2005), 33 states have internal predecessors, (2005), 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-09 06:01:44,089 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:01:44,089 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 140
[2024-03-09 06:01:44,089 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:02:05,024 INFO  L124   PetriNetUnfolderBase]: 34937/65428 cut-off events.
[2024-03-09 06:02:05,024 INFO  L125   PetriNetUnfolderBase]: For 368459/368593 co-relation queries the response was YES.
[2024-03-09 06:02:05,642 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 326369 conditions, 65428 events. 34937/65428 cut-off events. For 368459/368593 co-relation queries the response was YES. Maximal size of possible extension queue 1837. Compared 622296 event pairs, 6122 based on Foata normal form. 589/63062 useless extension candidates. Maximal degree in co-relation 323976. Up to 34763 conditions per place. 
[2024-03-09 06:02:06,078 INFO  L140   encePairwiseOnDemand]: 106/140 looper letters, 1643 selfloop transitions, 828 changer transitions 1/2544 dead transitions.
[2024-03-09 06:02:06,078 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 2544 transitions, 38535 flow
[2024-03-09 06:02:06,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-03-09 06:02:06,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2024-03-09 06:02:06,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1803 transitions.
[2024-03-09 06:02:06,081 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5599378881987578
[2024-03-09 06:02:06,081 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1803 transitions.
[2024-03-09 06:02:06,081 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1803 transitions.
[2024-03-09 06:02:06,082 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:02:06,082 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1803 transitions.
[2024-03-09 06:02:06,084 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 78.3913043478261) internal successors, (1803), 23 states have internal predecessors, (1803), 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-09 06:02:06,087 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 140.0) internal successors, (3360), 24 states have internal predecessors, (3360), 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-09 06:02:06,088 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 140.0) internal successors, (3360), 24 states have internal predecessors, (3360), 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-09 06:02:06,088 INFO  L175             Difference]: Start difference. First operand has 264 places, 1690 transitions, 24551 flow. Second operand 23 states and 1803 transitions.
[2024-03-09 06:02:06,088 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 2544 transitions, 38535 flow
[2024-03-09 06:02:17,043 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 2544 transitions, 38407 flow, removed 64 selfloop flow, removed 0 redundant places.
[2024-03-09 06:02:17,075 INFO  L231             Difference]: Finished difference. Result has 295 places, 2084 transitions, 33531 flow
[2024-03-09 06:02:17,076 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=24423, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=540, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1070, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=33531, PETRI_PLACES=295, PETRI_TRANSITIONS=2084}
[2024-03-09 06:02:17,077 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 155 predicate places.
[2024-03-09 06:02:17,077 INFO  L495      AbstractCegarLoop]: Abstraction has has 295 places, 2084 transitions, 33531 flow
[2024-03-09 06:02:17,077 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 60.75757575757576) internal successors, (2005), 33 states have internal predecessors, (2005), 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-09 06:02:17,077 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:02:17,078 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, 1, 1, 1, 1, 1, 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-09 06:02:17,082 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-09 06:02:17,279 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:02:17,279 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:02:17,280 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:02:17,280 INFO  L85        PathProgramCache]: Analyzing trace with hash 711159395, now seen corresponding path program 1 times
[2024-03-09 06:02:17,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:02:17,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92176734]
[2024-03-09 06:02:17,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:02:17,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:02:17,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:02:17,621 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-09 06:02:17,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:02:17,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92176734]
[2024-03-09 06:02:17,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92176734] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:02:17,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774678873]
[2024-03-09 06:02:17,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:02:17,622 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:02:17,622 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:02:17,623 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-09 06:02:17,629 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-09 06:02:17,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:02:17,721 INFO  L262         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjunts are in the unsatisfiable core
[2024-03-09 06:02:17,728 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:02:17,808 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-09 06:02:17,933 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 11 treesize of output 7
[2024-03-09 06:02:17,963 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 19 treesize of output 18
[2024-03-09 06:02:17,996 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:02:18,045 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:02:18,207 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:02:18,208 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 37 treesize of output 26
[2024-03-09 06:02:18,241 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-09 06:02:18,242 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:02:18,263 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-09 06:02:18,334 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_25) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2024-03-09 06:02:18,383 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25))) (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) is different from false
[2024-03-09 06:02:18,418 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1)))) (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))))) is different from false
[2024-03-09 06:02:18,450 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25)))))) is different from false
[2024-03-09 06:02:18,478 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))) (forall ((v_ArrVal_922 (Array Int Int)) (v_threadThread1of2ForFork0_~t~0.base_25 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_25) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_25 v_ArrVal_922) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0)))))) is different from false
[2024-03-09 06:02:18,509 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:02:18,509 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2024-03-09 06:02:18,515 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:02:18,515 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2024-03-09 06:02:18,521 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 5 treesize of output 3
[2024-03-09 06:02:18,528 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:02:18,528 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 06:02:18,535 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:02:18,535 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 06:02:18,542 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:02:18,543 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 06:02:18,646 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 15 treesize of output 7
[2024-03-09 06:02:18,689 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-09 06:02:18,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774678873] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:02:18,690 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:02:18,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36
[2024-03-09 06:02:18,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183729594]
[2024-03-09 06:02:18,690 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:02:18,690 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2024-03-09 06:02:18,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:02:18,691 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2024-03-09 06:02:18,691 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=812, Unknown=6, NotChecked=378, Total=1332
[2024-03-09 06:02:18,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 140
[2024-03-09 06:02:18,874 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 2084 transitions, 33531 flow. Second operand  has 37 states, 37 states have (on average 62.62162162162162) internal successors, (2317), 37 states have internal predecessors, (2317), 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-09 06:02:18,874 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:02:18,874 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 140
[2024-03-09 06:02:18,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:02:46,211 INFO  L124   PetriNetUnfolderBase]: 38237/72412 cut-off events.
[2024-03-09 06:02:46,211 INFO  L125   PetriNetUnfolderBase]: For 593565/593784 co-relation queries the response was YES.
[2024-03-09 06:02:46,966 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 413614 conditions, 72412 events. 38237/72412 cut-off events. For 593565/593784 co-relation queries the response was YES. Maximal size of possible extension queue 1866. Compared 691796 event pairs, 6436 based on Foata normal form. 313/69043 useless extension candidates. Maximal degree in co-relation 409644. Up to 30108 conditions per place. 
[2024-03-09 06:02:47,283 INFO  L140   encePairwiseOnDemand]: 103/140 looper letters, 1794 selfloop transitions, 1319 changer transitions 0/3196 dead transitions.
[2024-03-09 06:02:47,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 3196 transitions, 56370 flow
[2024-03-09 06:02:47,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-09 06:02:47,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-09 06:02:47,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1473 transitions.
[2024-03-09 06:02:47,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5537593984962406
[2024-03-09 06:02:47,285 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1473 transitions.
[2024-03-09 06:02:47,285 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1473 transitions.
[2024-03-09 06:02:47,286 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:02:47,286 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1473 transitions.
[2024-03-09 06:02:47,287 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 77.52631578947368) internal successors, (1473), 19 states have internal predecessors, (1473), 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-09 06:02:47,289 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 140.0) internal successors, (2800), 20 states have internal predecessors, (2800), 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-09 06:02:47,289 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 140.0) internal successors, (2800), 20 states have internal predecessors, (2800), 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-09 06:02:47,290 INFO  L175             Difference]: Start difference. First operand has 295 places, 2084 transitions, 33531 flow. Second operand 19 states and 1473 transitions.
[2024-03-09 06:02:47,290 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 3196 transitions, 56370 flow
[2024-03-09 06:03:12,080 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 3196 transitions, 56228 flow, removed 54 selfloop flow, removed 13 redundant places.
[2024-03-09 06:03:12,125 INFO  L231             Difference]: Finished difference. Result has 308 places, 2718 transitions, 50809 flow
[2024-03-09 06:03:12,127 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=33395, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2084, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=685, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=50809, PETRI_PLACES=308, PETRI_TRANSITIONS=2718}
[2024-03-09 06:03:12,127 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 168 predicate places.
[2024-03-09 06:03:12,127 INFO  L495      AbstractCegarLoop]: Abstraction has has 308 places, 2718 transitions, 50809 flow
[2024-03-09 06:03:12,128 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 62.62162162162162) internal successors, (2317), 37 states have internal predecessors, (2317), 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-09 06:03:12,128 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:03:12,128 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 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]
[2024-03-09 06:03:12,134 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-09 06:03:12,329 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-09 06:03:12,329 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:03:12,330 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:03:12,330 INFO  L85        PathProgramCache]: Analyzing trace with hash 1352211639, now seen corresponding path program 2 times
[2024-03-09 06:03:12,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:03:12,331 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207909967]
[2024-03-09 06:03:12,331 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:03:12,331 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:03:12,352 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:03:12,771 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:03:12,771 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:03:12,771 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207909967]
[2024-03-09 06:03:12,772 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207909967] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:03:12,772 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851387991]
[2024-03-09 06:03:12,772 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 06:03:12,772 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:03:12,772 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:03:12,783 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-09 06:03:12,784 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-09 06:03:12,956 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 06:03:12,956 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:03:12,958 INFO  L262         TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 63 conjunts are in the unsatisfiable core
[2024-03-09 06:03:12,963 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:03:13,049 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-09 06:03:13,089 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-09 06:03:13,090 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-09 06:03:13,179 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-03-09 06:03:13,180 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26
[2024-03-09 06:03:13,245 INFO  L349             Elim1Store]: treesize reduction 32, result has 34.7 percent of original size
[2024-03-09 06:03:13,246 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 29
[2024-03-09 06:03:13,440 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 7 treesize of output 3
[2024-03-09 06:03:13,457 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:03:13,457 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 24
[2024-03-09 06:03:14,110 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:03:14,157 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 06:03:14,224 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-09 06:03:14,293 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 06:03:14,354 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 06:03:14,466 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48
[2024-03-09 06:03:14,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:03:14,543 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:03:14,663 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1038 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1038))) (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1038 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1038))) (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1038 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1038))) (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| 0))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1038 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1038))) (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-09 06:03:19,836 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:03:19,836 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 62
[2024-03-09 06:03:19,854 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:03:19,855 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 212
[2024-03-09 06:03:19,878 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 173 treesize of output 157
[2024-03-09 06:03:20,032 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:03:20,033 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 53
[2024-03-09 06:03:20,063 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:03:20,064 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 62
[2024-03-09 06:03:20,069 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 06:03:20,085 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:03:20,085 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 118
[2024-03-09 06:03:20,097 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 40 treesize of output 36
[2024-03-09 06:03:20,105 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 70
[2024-03-09 06:03:20,139 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:03:20,139 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 62
[2024-03-09 06:03:20,145 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 06:03:20,157 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:03:20,158 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 106
[2024-03-09 06:03:20,166 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 36 treesize of output 32
[2024-03-09 06:03:20,173 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 70
[2024-03-09 06:03:20,223 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:03:20,223 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 60
[2024-03-09 06:03:20,228 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 06:03:20,240 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 06:03:20,241 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 110
[2024-03-09 06:03:20,250 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 34 treesize of output 32
[2024-03-09 06:03:20,258 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 62
[2024-03-09 06:03:22,865 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 105 treesize of output 85
[2024-03-09 06:03:23,606 INFO  L349             Elim1Store]: treesize reduction 11, result has 88.2 percent of original size
[2024-03-09 06:03:23,606 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 159
[2024-03-09 06:03:26,532 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 06:03:26,532 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851387991] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:03:26,532 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:03:26,532 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24, 21] total 57
[2024-03-09 06:03:26,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186268259]
[2024-03-09 06:03:26,534 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:03:26,536 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 58 states
[2024-03-09 06:03:26,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:03:26,539 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants.
[2024-03-09 06:03:26,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2870, Unknown=25, NotChecked=110, Total=3306
[2024-03-09 06:03:27,659 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 37 out of 140
[2024-03-09 06:03:27,661 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 2718 transitions, 50809 flow. Second operand  has 58 states, 58 states have (on average 39.63793103448276) internal successors, (2299), 58 states have internal predecessors, (2299), 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-09 06:03:27,661 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:03:27,661 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 140
[2024-03-09 06:03:27,661 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:05:29,340 INFO  L124   PetriNetUnfolderBase]: 98262/177909 cut-off events.
[2024-03-09 06:05:29,340 INFO  L125   PetriNetUnfolderBase]: For 1887021/1887499 co-relation queries the response was YES.
[2024-03-09 06:05:31,428 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1095229 conditions, 177909 events. 98262/177909 cut-off events. For 1887021/1887499 co-relation queries the response was YES. Maximal size of possible extension queue 4342. Compared 1833510 event pairs, 11909 based on Foata normal form. 1687/171680 useless extension candidates. Maximal degree in co-relation 1091294. Up to 53889 conditions per place. 
[2024-03-09 06:05:32,303 INFO  L140   encePairwiseOnDemand]: 90/140 looper letters, 3734 selfloop transitions, 5295 changer transitions 7/9074 dead transitions.
[2024-03-09 06:05:32,303 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 9074 transitions, 172495 flow
[2024-03-09 06:05:32,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. 
[2024-03-09 06:05:32,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 117 states.
[2024-03-09 06:05:32,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 6089 transitions.
[2024-03-09 06:05:32,310 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37173382173382175
[2024-03-09 06:05:32,310 INFO  L72            ComplementDD]: Start complementDD. Operand 117 states and 6089 transitions.
[2024-03-09 06:05:32,310 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 117 states and 6089 transitions.
[2024-03-09 06:05:32,311 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:05:32,311 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 117 states and 6089 transitions.
[2024-03-09 06:05:32,318 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 118 states, 117 states have (on average 52.042735042735046) internal successors, (6089), 117 states have internal predecessors, (6089), 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-09 06:05:32,328 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 118 states, 118 states have (on average 140.0) internal successors, (16520), 118 states have internal predecessors, (16520), 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-09 06:05:32,329 INFO  L81            ComplementDD]: Finished complementDD. Result  has 118 states, 118 states have (on average 140.0) internal successors, (16520), 118 states have internal predecessors, (16520), 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-09 06:05:32,329 INFO  L175             Difference]: Start difference. First operand has 308 places, 2718 transitions, 50809 flow. Second operand 117 states and 6089 transitions.
[2024-03-09 06:05:32,329 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 9074 transitions, 172495 flow
[2024-03-09 06:07:27,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 9074 transitions, 172367 flow, removed 18 selfloop flow, removed 10 redundant places.
[2024-03-09 06:07:27,336 INFO  L231             Difference]: Finished difference. Result has 492 places, 6662 transitions, 152513 flow
[2024-03-09 06:07:27,338 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=50735, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1681, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=117, PETRI_FLOW=152513, PETRI_PLACES=492, PETRI_TRANSITIONS=6662}
[2024-03-09 06:07:27,338 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 352 predicate places.
[2024-03-09 06:07:27,338 INFO  L495      AbstractCegarLoop]: Abstraction has has 492 places, 6662 transitions, 152513 flow
[2024-03-09 06:07:27,339 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 58 states, 58 states have (on average 39.63793103448276) internal successors, (2299), 58 states have internal predecessors, (2299), 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-09 06:07:27,339 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:07:27,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:07:27,346 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2024-03-09 06:07:27,540 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,SelfDestructingSolverStorable17
[2024-03-09 06:07:27,540 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:07:27,541 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:07:27,541 INFO  L85        PathProgramCache]: Analyzing trace with hash 1837952500, now seen corresponding path program 1 times
[2024-03-09 06:07:27,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:07:27,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077734696]
[2024-03-09 06:07:27,541 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:07:27,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:07:27,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:07:28,305 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-09 06:07:28,305 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:07:28,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077734696]
[2024-03-09 06:07:28,306 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077734696] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:07:28,306 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985899160]
[2024-03-09 06:07:28,306 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:07:28,306 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:07:28,306 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:07:28,307 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-09 06:07:28,309 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-09 06:07:28,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:07:28,433 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-03-09 06:07:28,437 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:07:28,447 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-09 06:07:28,511 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-09 06:07:28,512 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-09 06:07:28,740 INFO  L349             Elim1Store]: treesize reduction 32, result has 45.8 percent of original size
[2024-03-09 06:07:28,741 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33
[2024-03-09 06:07:28,832 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:07:28,844 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 06:07:28,845 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30
[2024-03-09 06:07:29,412 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-03-09 06:07:29,412 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 62
[2024-03-09 06:07:29,450 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 24 treesize of output 18
[2024-03-09 06:07:30,013 INFO  L349             Elim1Store]: treesize reduction 36, result has 29.4 percent of original size
[2024-03-09 06:07:30,014 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 63
[2024-03-09 06:07:30,411 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:07:30,411 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 50
[2024-03-09 06:07:30,448 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 06:07:30,468 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 21 treesize of output 20
[2024-03-09 06:07:30,484 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:07:30,485 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 06:07:30,509 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:07:30,510 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 06:07:30,553 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 43 treesize of output 32
[2024-03-09 06:07:30,564 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-09 06:07:30,564 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:07:31,247 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1157) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-09 06:07:31,273 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:07:31,274 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-09 06:07:31,281 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:07:31,282 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32
[2024-03-09 06:07:31,297 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:07:31,297 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 06:07:31,307 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:07:31,308 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-09 06:07:31,317 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:07:31,317 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 06:07:31,539 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1152) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-09 06:07:31,551 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1152) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2024-03-09 06:07:31,685 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int)) (v_ArrVal_1151 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1151) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1152) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2024-03-09 06:07:32,170 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:07:32,170 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 144
[2024-03-09 06:07:32,188 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 52 treesize of output 50
[2024-03-09 06:07:32,196 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 50 treesize of output 46
[2024-03-09 06:07:32,535 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-09 06:07:32,535 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [985899160] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:07:32,535 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:07:32,536 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 48
[2024-03-09 06:07:32,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109650099]
[2024-03-09 06:07:32,536 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:07:32,536 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2024-03-09 06:07:32,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:07:32,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2024-03-09 06:07:32,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1740, Unknown=86, NotChecked=356, Total=2352
[2024-03-09 06:07:33,172 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 140
[2024-03-09 06:07:33,174 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 6662 transitions, 152513 flow. Second operand  has 49 states, 49 states have (on average 53.142857142857146) internal successors, (2604), 49 states have internal predecessors, (2604), 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-09 06:07:33,175 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:07:33,175 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 140
[2024-03-09 06:07:33,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:12:43,040 INFO  L124   PetriNetUnfolderBase]: 122759/224239 cut-off events.
[2024-03-09 06:12:43,040 INFO  L125   PetriNetUnfolderBase]: For 7336965/7338480 co-relation queries the response was YES.
[2024-03-09 06:12:48,516 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1829246 conditions, 224239 events. 122759/224239 cut-off events. For 7336965/7338480 co-relation queries the response was YES. Maximal size of possible extension queue 5827. Compared 2383756 event pairs, 18033 based on Foata normal form. 466/215126 useless extension candidates. Maximal degree in co-relation 1825393. Up to 102839 conditions per place. 
[2024-03-09 06:12:49,866 INFO  L140   encePairwiseOnDemand]: 82/140 looper letters, 8310 selfloop transitions, 2074 changer transitions 9/10527 dead transitions.
[2024-03-09 06:12:49,866 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 10527 transitions, 245835 flow
[2024-03-09 06:12:49,867 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. 
[2024-03-09 06:12:49,867 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2024-03-09 06:12:49,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 3626 transitions.
[2024-03-09 06:12:49,873 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4625
[2024-03-09 06:12:49,874 INFO  L72            ComplementDD]: Start complementDD. Operand 56 states and 3626 transitions.
[2024-03-09 06:12:49,874 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 56 states and 3626 transitions.
[2024-03-09 06:12:49,874 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:12:49,874 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 3626 transitions.
[2024-03-09 06:12:49,879 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 57 states, 56 states have (on average 64.75) internal successors, (3626), 56 states have internal predecessors, (3626), 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-09 06:12:49,887 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 57 states, 57 states have (on average 140.0) internal successors, (7980), 57 states have internal predecessors, (7980), 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-09 06:12:49,888 INFO  L81            ComplementDD]: Finished complementDD. Result  has 57 states, 57 states have (on average 140.0) internal successors, (7980), 57 states have internal predecessors, (7980), 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-09 06:12:49,888 INFO  L175             Difference]: Start difference. First operand has 492 places, 6662 transitions, 152513 flow. Second operand 56 states and 3626 transitions.
[2024-03-09 06:12:49,888 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 10527 transitions, 245835 flow
Killed by 15
