./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-race.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-race.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 45fad48bfe96d0f14e389e84f324114cc53be1be8279cdb3b9a03da28604375f
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 05:57:14,916 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 05:57:14,955 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 05:57:14,959 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 05:57:14,959 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 05:57:14,978 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 05:57:14,979 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 05:57:14,979 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 05:57:14,979 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 05:57:14,980 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 05:57:14,980 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 05:57:14,980 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 05:57:14,980 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 05:57:14,981 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 05:57:14,981 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 05:57:14,981 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 05:57:14,982 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 05:57:14,982 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 05:57:14,982 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 05:57:14,982 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 05:57:14,983 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 05:57:14,983 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 05:57:14,983 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 05:57:14,984 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 05:57:14,984 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 05:57:14,984 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 05:57:14,984 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 05:57:14,984 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 05:57:14,985 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 05:57:14,985 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 05:57:14,988 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 05:57:14,988 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 05:57:14,988 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 05:57:14,989 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 05:57:14,989 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 05:57:14,989 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 05:57:14,989 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 05:57:14,990 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 05:57:14,990 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 05:57:14,990 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 05:57:14,990 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 05:57:14,991 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 -> 45fad48bfe96d0f14e389e84f324114cc53be1be8279cdb3b9a03da28604375f
[2024-03-09 05:57:15,154 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 05:57:15,178 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 05:57:15,180 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 05:57:15,180 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 05:57:15,182 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 05:57:15,185 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array-race.i
[2024-03-09 05:57:16,239 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 05:57:16,433 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 05:57:16,433 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array-race.i
[2024-03-09 05:57:16,446 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/85af7dd4e/ed3c0241af604b7992e4d0af88939dac/FLAGe52b7b6a2
[2024-03-09 05:57:16,813 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/85af7dd4e/ed3c0241af604b7992e4d0af88939dac
[2024-03-09 05:57:16,815 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 05:57:16,816 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 05:57:16,817 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 05:57:16,817 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 05:57:16,822 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 05:57:16,822 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:57:16" (1/1) ...
[2024-03-09 05:57:16,823 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f16c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:16, skipping insertion in model container
[2024-03-09 05:57:16,823 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:57:16" (1/1) ...
[2024-03-09 05:57:16,866 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 05:57:17,127 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 05:57:17,133 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 05:57:17,166 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 05:57:17,222 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 05:57:17,223 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17 WrapperNode
[2024-03-09 05:57:17,223 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 05:57:17,224 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 05:57:17,224 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 05:57:17,224 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 05:57:17,233 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17" (1/1) ...
[2024-03-09 05:57:17,248 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17" (1/1) ...
[2024-03-09 05:57:17,276 INFO  L138                Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99
[2024-03-09 05:57:17,277 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 05:57:17,277 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 05:57:17,277 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 05:57:17,277 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 05:57:17,285 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17" (1/1) ...
[2024-03-09 05:57:17,285 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17" (1/1) ...
[2024-03-09 05:57:17,288 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17" (1/1) ...
[2024-03-09 05:57:17,288 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17" (1/1) ...
[2024-03-09 05:57:17,295 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17" (1/1) ...
[2024-03-09 05:57:17,298 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17" (1/1) ...
[2024-03-09 05:57:17,299 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17" (1/1) ...
[2024-03-09 05:57:17,300 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17" (1/1) ...
[2024-03-09 05:57:17,303 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 05:57:17,303 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 05:57:17,303 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 05:57:17,304 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 05:57:17,304 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17" (1/1) ...
[2024-03-09 05:57:17,309 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 05:57:17,318 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:57:17,335 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 05:57:17,338 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 05:57:17,358 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 05:57:17,358 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 05:57:17,358 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 05:57:17,358 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 05:57:17,358 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 05:57:17,359 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 05:57:17,359 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 05:57:17,359 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 05:57:17,359 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 05:57:17,359 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 05:57:17,359 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 05:57:17,360 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 05:57:17,501 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 05:57:17,503 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 05:57:17,684 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 05:57:17,693 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 05:57:17,693 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 05:57:17,694 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:57:17 BoogieIcfgContainer
[2024-03-09 05:57:17,694 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 05:57:17,696 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 05:57:17,696 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 05:57:17,698 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 05:57:17,698 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:57:16" (1/3) ...
[2024-03-09 05:57:17,699 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298d9ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:57:17, skipping insertion in model container
[2024-03-09 05:57:17,699 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:57:17" (2/3) ...
[2024-03-09 05:57:17,699 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298d9ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:57:17, skipping insertion in model container
[2024-03-09 05:57:17,699 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:57:17" (3/3) ...
[2024-03-09 05:57:17,700 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array-race.i
[2024-03-09 05:57:17,706 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 05:57:17,712 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 05:57:17,713 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2024-03-09 05:57:17,713 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 05:57:17,757 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 05:57:17,782 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow
[2024-03-09 05:57:17,832 INFO  L124   PetriNetUnfolderBase]: 6/188 cut-off events.
[2024-03-09 05:57:17,832 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 05:57:17,836 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 05:57:17,836 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 251 flow
[2024-03-09 05:57:17,840 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 251 flow
[2024-03-09 05:57:17,847 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 05:57:17,852 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;@1679acb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 05:57:17,852 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-09 05:57:17,867 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 05:57:17,868 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-03-09 05:57:17,868 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 05:57:17,868 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:17,868 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 05:57:17,869 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 05:57:17,873 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:17,873 INFO  L85        PathProgramCache]: Analyzing trace with hash 625921240, now seen corresponding path program 1 times
[2024-03-09 05:57:17,881 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:17,881 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315170110]
[2024-03-09 05:57:17,881 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:17,882 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:17,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:18,382 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 05:57:18,383 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:18,383 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315170110]
[2024-03-09 05:57:18,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315170110] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:57:18,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:57:18,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:57:18,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562932616]
[2024-03-09 05:57:18,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:57:18,392 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:57:18,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:18,414 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:57:18,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:57:18,846 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122
[2024-03-09 05:57:18,850 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 05:57:18,850 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:18,850 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122
[2024-03-09 05:57:18,851 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:19,015 INFO  L124   PetriNetUnfolderBase]: 81/497 cut-off events.
[2024-03-09 05:57:19,016 INFO  L125   PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES.
[2024-03-09 05:57:19,017 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 05:57:19,020 INFO  L140   encePairwiseOnDemand]: 102/122 looper letters, 28 selfloop transitions, 24 changer transitions 1/149 dead transitions.
[2024-03-09 05:57:19,020 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 149 transitions, 409 flow
[2024-03-09 05:57:19,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:57:19,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:57:19,030 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-09 05:57:19,032 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756830601092896
[2024-03-09 05:57:19,033 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-09 05:57:19,033 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-09 05:57:19,036 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:19,037 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-09 05:57:19,042 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 05:57:19,047 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 05:57:19,047 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 05:57:19,049 INFO  L175             Difference]: Start difference. First operand has 121 places, 122 transitions, 251 flow. Second operand 6 states and 641 transitions.
[2024-03-09 05:57:19,049 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 149 transitions, 409 flow
[2024-03-09 05:57:19,053 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 05:57:19,056 INFO  L231             Difference]: Finished difference. Result has 131 places, 142 transitions, 421 flow
[2024-03-09 05:57:19,058 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 05:57:19,061 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places.
[2024-03-09 05:57:19,061 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 421 flow
[2024-03-09 05:57:19,061 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 05:57:19,061 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:19,062 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 05:57:19,062 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 05:57:19,062 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 05:57:19,063 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:19,063 INFO  L85        PathProgramCache]: Analyzing trace with hash -519029290, now seen corresponding path program 1 times
[2024-03-09 05:57:19,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:19,063 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660141669]
[2024-03-09 05:57:19,063 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:19,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:19,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:19,148 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 05:57:19,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:19,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660141669]
[2024-03-09 05:57:19,149 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660141669] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:57:19,149 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:57:19,149 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:57:19,149 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825523673]
[2024-03-09 05:57:19,149 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:57:19,150 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 05:57:19,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:19,151 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 05:57:19,151 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 05:57:19,216 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 122
[2024-03-09 05:57:19,217 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 05:57:19,217 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:19,217 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 122
[2024-03-09 05:57:19,217 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:19,280 INFO  L124   PetriNetUnfolderBase]: 59/485 cut-off events.
[2024-03-09 05:57:19,280 INFO  L125   PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES.
[2024-03-09 05:57:19,282 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 05:57:19,283 INFO  L140   encePairwiseOnDemand]: 114/122 looper letters, 11 selfloop transitions, 6 changer transitions 1/147 dead transitions.
[2024-03-09 05:57:19,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 467 flow
[2024-03-09 05:57:19,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:57:19,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:57:19,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions.
[2024-03-09 05:57:19,288 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.894808743169399
[2024-03-09 05:57:19,288 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 655 transitions.
[2024-03-09 05:57:19,288 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions.
[2024-03-09 05:57:19,288 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:19,288 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions.
[2024-03-09 05:57:19,290 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 05:57:19,291 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 05:57:19,292 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 05:57:19,292 INFO  L175             Difference]: Start difference. First operand has 131 places, 142 transitions, 421 flow. Second operand 6 states and 655 transitions.
[2024-03-09 05:57:19,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 467 flow
[2024-03-09 05:57:19,296 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 05:57:19,299 INFO  L231             Difference]: Finished difference. Result has 139 places, 146 transitions, 463 flow
[2024-03-09 05:57:19,299 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 05:57:19,300 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places.
[2024-03-09 05:57:19,300 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 146 transitions, 463 flow
[2024-03-09 05:57:19,301 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 05:57:19,301 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:19,301 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 05:57:19,301 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 05:57:19,302 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 05:57:19,302 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:19,303 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345010082, now seen corresponding path program 1 times
[2024-03-09 05:57:19,303 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:19,303 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144271317]
[2024-03-09 05:57:19,303 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:19,304 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:19,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:19,511 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 05:57:19,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:19,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144271317]
[2024-03-09 05:57:19,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144271317] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:57:19,512 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:57:19,512 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:57:19,512 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334056646]
[2024-03-09 05:57:19,512 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:57:19,513 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:57:19,514 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:19,514 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:57:19,514 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:57:19,768 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122
[2024-03-09 05:57:19,769 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 05:57:19,769 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:19,769 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122
[2024-03-09 05:57:19,769 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:19,963 INFO  L124   PetriNetUnfolderBase]: 207/964 cut-off events.
[2024-03-09 05:57:19,963 INFO  L125   PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES.
[2024-03-09 05:57:19,966 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 05:57:19,968 INFO  L140   encePairwiseOnDemand]: 99/122 looper letters, 51 selfloop transitions, 50 changer transitions 4/206 dead transitions.
[2024-03-09 05:57:19,969 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 206 transitions, 900 flow
[2024-03-09 05:57:19,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:57:19,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:57:19,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions.
[2024-03-09 05:57:19,970 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8415300546448088
[2024-03-09 05:57:19,971 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 616 transitions.
[2024-03-09 05:57:19,971 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions.
[2024-03-09 05:57:19,971 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:19,971 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions.
[2024-03-09 05:57:19,972 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 05:57:19,974 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 05:57:19,974 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 05:57:19,974 INFO  L175             Difference]: Start difference. First operand has 139 places, 146 transitions, 463 flow. Second operand 6 states and 616 transitions.
[2024-03-09 05:57:19,975 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 206 transitions, 900 flow
[2024-03-09 05:57:19,978 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 05:57:19,980 INFO  L231             Difference]: Finished difference. Result has 148 places, 192 transitions, 919 flow
[2024-03-09 05:57:19,980 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 05:57:19,981 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 27 predicate places.
[2024-03-09 05:57:19,981 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 192 transitions, 919 flow
[2024-03-09 05:57:19,981 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 05:57:19,981 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:19,982 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 05:57:19,982 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 05:57:19,982 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 05:57:19,982 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:19,982 INFO  L85        PathProgramCache]: Analyzing trace with hash 808891466, now seen corresponding path program 1 times
[2024-03-09 05:57:19,982 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:19,983 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206099388]
[2024-03-09 05:57:19,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:19,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:20,019 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:20,268 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 05:57:20,268 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:20,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206099388]
[2024-03-09 05:57:20,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206099388] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:57:20,268 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:57:20,268 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:57:20,268 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266490261]
[2024-03-09 05:57:20,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:57:20,269 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:57:20,269 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:20,270 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:57:20,270 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:57:20,377 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 122
[2024-03-09 05:57:20,378 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 05:57:20,378 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:20,379 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 122
[2024-03-09 05:57:20,379 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:20,738 INFO  L124   PetriNetUnfolderBase]: 584/1937 cut-off events.
[2024-03-09 05:57:20,738 INFO  L125   PetriNetUnfolderBase]: For 1463/1580 co-relation queries the response was YES.
[2024-03-09 05:57:20,742 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 05:57:20,748 INFO  L140   encePairwiseOnDemand]: 91/122 looper letters, 98 selfloop transitions, 123 changer transitions 3/314 dead transitions.
[2024-03-09 05:57:20,748 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 314 transitions, 1919 flow
[2024-03-09 05:57:20,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:57:20,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:57:20,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-09 05:57:20,750 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756830601092896
[2024-03-09 05:57:20,750 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-09 05:57:20,750 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-09 05:57:20,751 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:20,751 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-09 05:57:20,752 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 05:57:20,753 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 05:57:20,754 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 05:57:20,754 INFO  L175             Difference]: Start difference. First operand has 148 places, 192 transitions, 919 flow. Second operand 6 states and 641 transitions.
[2024-03-09 05:57:20,754 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 314 transitions, 1919 flow
[2024-03-09 05:57:20,763 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 05:57:20,767 INFO  L231             Difference]: Finished difference. Result has 151 places, 311 transitions, 2033 flow
[2024-03-09 05:57:20,767 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 05:57:20,767 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 30 predicate places.
[2024-03-09 05:57:20,768 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 311 transitions, 2033 flow
[2024-03-09 05:57:20,768 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 05:57:20,768 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:20,768 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 05:57:20,768 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 05:57:20,769 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 05:57:20,769 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:20,769 INFO  L85        PathProgramCache]: Analyzing trace with hash 868130232, now seen corresponding path program 1 times
[2024-03-09 05:57:20,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:20,769 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034019511]
[2024-03-09 05:57:20,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:20,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:20,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:21,296 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 05:57:21,297 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:21,297 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034019511]
[2024-03-09 05:57:21,297 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034019511] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:57:21,297 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6753647]
[2024-03-09 05:57:21,297 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:21,297 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:57:21,298 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:57:21,299 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 05:57:21,309 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 05:57:21,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:21,429 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-09 05:57:21,443 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:57:21,486 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 05:57:21,530 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:57:21,530 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 05:57:21,632 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 05:57:21,637 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3
[2024-03-09 05:57:21,860 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 05:57:21,901 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 05:57:21,946 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 05:57:22,002 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 05:57:22,223 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 05:57:22,260 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 05:57:22,261 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:57:22,307 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 05:57:22,479 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 05:57:22,510 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 05:57:22,666 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 05:57:22,670 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 8 treesize of output 4
[2024-03-09 05:57:22,695 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 05:57:22,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [6753647] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:57:22,696 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:57:22,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 30
[2024-03-09 05:57:22,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091088435]
[2024-03-09 05:57:22,696 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:57:22,698 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-03-09 05:57:22,702 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:22,703 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-03-09 05:57:22,704 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=659, Unknown=3, NotChecked=162, Total=930
[2024-03-09 05:57:22,752 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 41 out of 122
[2024-03-09 05:57:22,754 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 311 transitions, 2033 flow. Second operand  has 31 states, 31 states have (on average 43.806451612903224) internal successors, (1358), 31 states have internal predecessors, (1358), 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 05:57:22,754 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:22,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 122
[2024-03-09 05:57:22,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:25,960 INFO  L124   PetriNetUnfolderBase]: 1195/3063 cut-off events.
[2024-03-09 05:57:25,960 INFO  L125   PetriNetUnfolderBase]: For 4438/4440 co-relation queries the response was YES.
[2024-03-09 05:57:25,966 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10672 conditions, 3063 events. 1195/3063 cut-off events. For 4438/4440 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 21537 event pairs, 166 based on Foata normal form. 41/3067 useless extension candidates. Maximal degree in co-relation 10383. Up to 1033 conditions per place. 
[2024-03-09 05:57:25,976 INFO  L140   encePairwiseOnDemand]: 86/122 looper letters, 431 selfloop transitions, 177 changer transitions 54/703 dead transitions.
[2024-03-09 05:57:25,976 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 703 transitions, 5379 flow
[2024-03-09 05:57:25,976 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 
[2024-03-09 05:57:25,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2024-03-09 05:57:25,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 1761 transitions.
[2024-03-09 05:57:25,981 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4510758196721312
[2024-03-09 05:57:25,981 INFO  L72            ComplementDD]: Start complementDD. Operand 32 states and 1761 transitions.
[2024-03-09 05:57:25,981 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 32 states and 1761 transitions.
[2024-03-09 05:57:25,982 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:25,982 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 1761 transitions.
[2024-03-09 05:57:25,987 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 33 states, 32 states have (on average 55.03125) internal successors, (1761), 32 states have internal predecessors, (1761), 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 05:57:25,992 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 33 states, 33 states have (on average 122.0) internal successors, (4026), 33 states have internal predecessors, (4026), 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 05:57:25,994 INFO  L81            ComplementDD]: Finished complementDD. Result  has 33 states, 33 states have (on average 122.0) internal successors, (4026), 33 states have internal predecessors, (4026), 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 05:57:25,994 INFO  L175             Difference]: Start difference. First operand has 151 places, 311 transitions, 2033 flow. Second operand 32 states and 1761 transitions.
[2024-03-09 05:57:25,994 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 703 transitions, 5379 flow
[2024-03-09 05:57:26,023 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 703 transitions, 5289 flow, removed 45 selfloop flow, removed 0 redundant places.
[2024-03-09 05:57:26,033 INFO  L231             Difference]: Finished difference. Result has 196 places, 386 transitions, 3207 flow
[2024-03-09 05:57:26,033 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=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=3207, PETRI_PLACES=196, PETRI_TRANSITIONS=386}
[2024-03-09 05:57:26,037 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 75 predicate places.
[2024-03-09 05:57:26,037 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 386 transitions, 3207 flow
[2024-03-09 05:57:26,038 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 43.806451612903224) internal successors, (1358), 31 states have internal predecessors, (1358), 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 05:57:26,038 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:26,038 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 05:57:26,054 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-09 05:57:26,239 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 05:57:26,240 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 05:57:26,240 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:26,240 INFO  L85        PathProgramCache]: Analyzing trace with hash -1197716225, now seen corresponding path program 1 times
[2024-03-09 05:57:26,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:26,241 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288793777]
[2024-03-09 05:57:26,241 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:26,241 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:26,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:26,765 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 05:57:26,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:26,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288793777]
[2024-03-09 05:57:26,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288793777] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:57:26,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214390761]
[2024-03-09 05:57:26,765 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:26,765 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:57:26,766 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:57:26,768 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 05:57:26,775 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 05:57:26,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:26,871 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-09 05:57:26,874 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:57:26,880 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 05:57:26,904 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:57:26,905 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 05:57:26,945 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 05:57:27,133 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 05:57:27,166 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 05:57:27,207 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 05:57:27,258 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 05:57:27,322 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 05:57:27,364 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 05:57:27,364 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:57:27,389 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 05:57:27,404 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_~t~0.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 .cse0 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 .cse0 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)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0))))) is different from false
[2024-03-09 05:57:27,435 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_292 (Array Int Int))) (= (select (select (store .cse0 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 .cse0 c_threadThread1of1ForFork0_~t~0.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_~t~0.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_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0))))) is different from false
[2024-03-09 05:57:27,566 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 05:57:27,587 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 05:57:27,587 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214390761] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:57:27,588 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:57:27,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29
[2024-03-09 05:57:27,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869274197]
[2024-03-09 05:57:27,589 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:57:27,590 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-09 05:57:27,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:27,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-09 05:57:27,591 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=607, Unknown=3, NotChecked=156, Total=870
[2024-03-09 05:57:27,796 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 122
[2024-03-09 05:57:27,797 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 386 transitions, 3207 flow. Second operand  has 30 states, 30 states have (on average 52.3) internal successors, (1569), 30 states have internal predecessors, (1569), 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 05:57:27,797 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:27,797 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 122
[2024-03-09 05:57:27,798 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:29,285 INFO  L124   PetriNetUnfolderBase]: 935/2599 cut-off events.
[2024-03-09 05:57:29,285 INFO  L125   PetriNetUnfolderBase]: For 8750/8750 co-relation queries the response was YES.
[2024-03-09 05:57:29,293 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11083 conditions, 2599 events. 935/2599 cut-off events. For 8750/8750 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 18673 event pairs, 193 based on Foata normal form. 25/2572 useless extension candidates. Maximal degree in co-relation 10763. Up to 1249 conditions per place. 
[2024-03-09 05:57:29,303 INFO  L140   encePairwiseOnDemand]: 107/122 looper letters, 378 selfloop transitions, 34 changer transitions 28/493 dead transitions.
[2024-03-09 05:57:29,303 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 493 transitions, 4661 flow
[2024-03-09 05:57:29,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-09 05:57:29,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-09 05:57:29,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1088 transitions.
[2024-03-09 05:57:29,306 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49544626593806923
[2024-03-09 05:57:29,307 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1088 transitions.
[2024-03-09 05:57:29,307 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1088 transitions.
[2024-03-09 05:57:29,307 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:29,307 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1088 transitions.
[2024-03-09 05:57:29,309 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 05:57:29,312 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 05:57:29,312 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 05:57:29,312 INFO  L175             Difference]: Start difference. First operand has 196 places, 386 transitions, 3207 flow. Second operand 18 states and 1088 transitions.
[2024-03-09 05:57:29,312 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 493 transitions, 4661 flow
[2024-03-09 05:57:29,355 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 493 transitions, 4607 flow, removed 9 selfloop flow, removed 10 redundant places.
[2024-03-09 05:57:29,360 INFO  L231             Difference]: Finished difference. Result has 200 places, 370 transitions, 3051 flow
[2024-03-09 05:57:29,360 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 05:57:29,365 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 79 predicate places.
[2024-03-09 05:57:29,365 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 370 transitions, 3051 flow
[2024-03-09 05:57:29,366 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 52.3) internal successors, (1569), 30 states have internal predecessors, (1569), 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 05:57:29,366 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:29,366 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:29,372 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-09 05:57:29,570 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 05:57:29,570 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 05:57:29,571 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:29,571 INFO  L85        PathProgramCache]: Analyzing trace with hash -1693408392, now seen corresponding path program 1 times
[2024-03-09 05:57:29,571 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:29,572 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602547244]
[2024-03-09 05:57:29,572 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:29,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:29,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:29,821 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 05:57:29,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:29,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602547244]
[2024-03-09 05:57:29,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602547244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:57:29,821 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:57:29,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:57:29,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271007567]
[2024-03-09 05:57:29,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:57:29,822 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:57:29,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:29,822 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:57:29,822 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:57:30,107 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122
[2024-03-09 05:57:30,108 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 05:57:30,108 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:30,108 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122
[2024-03-09 05:57:30,108 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:30,379 INFO  L124   PetriNetUnfolderBase]: 520/1890 cut-off events.
[2024-03-09 05:57:30,380 INFO  L125   PetriNetUnfolderBase]: For 6293/6340 co-relation queries the response was YES.
[2024-03-09 05:57:30,385 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 1890 events. 520/1890 cut-off events. For 6293/6340 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14566 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 05:57:30,391 INFO  L140   encePairwiseOnDemand]: 111/122 looper letters, 120 selfloop transitions, 37 changer transitions 15/410 dead transitions.
[2024-03-09 05:57:30,391 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 410 transitions, 3815 flow
[2024-03-09 05:57:30,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:57:30,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:57:30,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions.
[2024-03-09 05:57:30,393 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8770491803278688
[2024-03-09 05:57:30,393 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 642 transitions.
[2024-03-09 05:57:30,393 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions.
[2024-03-09 05:57:30,393 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:30,393 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions.
[2024-03-09 05:57:30,395 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 05:57:30,395 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 05:57:30,396 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 05:57:30,396 INFO  L175             Difference]: Start difference. First operand has 200 places, 370 transitions, 3051 flow. Second operand 6 states and 642 transitions.
[2024-03-09 05:57:30,396 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 410 transitions, 3815 flow
[2024-03-09 05:57:30,424 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 05:57:30,428 INFO  L231             Difference]: Finished difference. Result has 194 places, 395 transitions, 3496 flow
[2024-03-09 05:57:30,429 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 05:57:30,429 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 73 predicate places.
[2024-03-09 05:57:30,429 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 395 transitions, 3496 flow
[2024-03-09 05:57:30,430 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 05:57:30,430 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:30,430 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 05:57:30,430 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 05:57:30,430 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 05:57:30,430 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:30,430 INFO  L85        PathProgramCache]: Analyzing trace with hash 2045064484, now seen corresponding path program 1 times
[2024-03-09 05:57:30,431 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:30,431 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246677886]
[2024-03-09 05:57:30,431 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:30,431 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:30,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:57:30,462 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 05:57:30,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:57:30,491 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 05:57:30,491 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 05:57:30,492 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-03-09 05:57:30,493 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-09 05:57:30,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-09 05:57:30,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-09 05:57:30,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-09 05:57:30,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-03-09 05:57:30,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-09 05:57:30,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-09 05:57:30,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-09 05:57:30,494 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 05:57:30,494 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:57:30,496 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 05:57:30,496 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 05:57:30,525 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 05:57:30,527 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 140 transitions, 296 flow
[2024-03-09 05:57:30,545 INFO  L124   PetriNetUnfolderBase]: 11/335 cut-off events.
[2024-03-09 05:57:30,545 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-09 05:57:30,545 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 05:57:30,546 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 140 transitions, 296 flow
[2024-03-09 05:57:30,547 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 140 places, 140 transitions, 296 flow
[2024-03-09 05:57:30,547 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 05:57:30,548 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;@1679acb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 05:57:30,548 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-03-09 05:57:30,550 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 05:57:30,550 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-03-09 05:57:30,550 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 05:57:30,550 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:30,550 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 05:57:30,550 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 05:57:30,551 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:30,551 INFO  L85        PathProgramCache]: Analyzing trace with hash -2031979688, now seen corresponding path program 1 times
[2024-03-09 05:57:30,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:30,551 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982225517]
[2024-03-09 05:57:30,551 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:30,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:30,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:30,687 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 05:57:30,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:30,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982225517]
[2024-03-09 05:57:30,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982225517] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:57:30,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:57:30,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:57:30,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185336826]
[2024-03-09 05:57:30,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:57:30,688 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:57:30,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:30,689 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:57:30,690 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:57:30,954 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140
[2024-03-09 05:57:30,955 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 05:57:30,955 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:30,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140
[2024-03-09 05:57:30,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:31,356 INFO  L124   PetriNetUnfolderBase]: 1139/4013 cut-off events.
[2024-03-09 05:57:31,357 INFO  L125   PetriNetUnfolderBase]: For 112/200 co-relation queries the response was YES.
[2024-03-09 05:57:31,361 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 4013 events. 1139/4013 cut-off events. For 112/200 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 05:57:31,371 INFO  L140   encePairwiseOnDemand]: 116/140 looper letters, 36 selfloop transitions, 43 changer transitions 1/188 dead transitions.
[2024-03-09 05:57:31,371 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 188 transitions, 558 flow
[2024-03-09 05:57:31,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:57:31,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:57:31,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions.
[2024-03-09 05:57:31,373 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8809523809523809
[2024-03-09 05:57:31,373 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 740 transitions.
[2024-03-09 05:57:31,373 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions.
[2024-03-09 05:57:31,374 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:31,374 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions.
[2024-03-09 05:57:31,375 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 05:57:31,376 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 05:57:31,377 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 05:57:31,377 INFO  L175             Difference]: Start difference. First operand has 140 places, 140 transitions, 296 flow. Second operand 6 states and 740 transitions.
[2024-03-09 05:57:31,377 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 188 transitions, 558 flow
[2024-03-09 05:57:31,378 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 05:57:31,380 INFO  L231             Difference]: Finished difference. Result has 150 places, 179 transitions, 588 flow
[2024-03-09 05:57:31,380 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 05:57:31,380 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 10 predicate places.
[2024-03-09 05:57:31,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 179 transitions, 588 flow
[2024-03-09 05:57:31,381 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 05:57:31,381 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:31,381 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 05:57:31,381 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 05:57:31,381 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 05:57:31,382 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:31,382 INFO  L85        PathProgramCache]: Analyzing trace with hash -28367262, now seen corresponding path program 1 times
[2024-03-09 05:57:31,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:31,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267933044]
[2024-03-09 05:57:31,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:31,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:31,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:31,425 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 05:57:31,425 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:31,425 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267933044]
[2024-03-09 05:57:31,425 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267933044] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:57:31,425 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:57:31,425 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:57:31,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56695156]
[2024-03-09 05:57:31,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:57:31,426 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 05:57:31,426 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:31,427 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 05:57:31,427 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 05:57:31,481 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140
[2024-03-09 05:57:31,481 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 05:57:31,481 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:31,481 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140
[2024-03-09 05:57:31,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:31,761 INFO  L124   PetriNetUnfolderBase]: 890/3527 cut-off events.
[2024-03-09 05:57:31,761 INFO  L125   PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES.
[2024-03-09 05:57:31,768 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 05:57:31,782 INFO  L140   encePairwiseOnDemand]: 132/140 looper letters, 14 selfloop transitions, 6 changer transitions 1/185 dead transitions.
[2024-03-09 05:57:31,782 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 185 transitions, 642 flow
[2024-03-09 05:57:31,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:57:31,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:57:31,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions.
[2024-03-09 05:57:31,785 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8976190476190476
[2024-03-09 05:57:31,785 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 754 transitions.
[2024-03-09 05:57:31,785 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions.
[2024-03-09 05:57:31,785 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:31,785 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions.
[2024-03-09 05:57:31,786 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 05:57:31,788 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 05:57:31,788 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 05:57:31,788 INFO  L175             Difference]: Start difference. First operand has 150 places, 179 transitions, 588 flow. Second operand 6 states and 754 transitions.
[2024-03-09 05:57:31,788 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 185 transitions, 642 flow
[2024-03-09 05:57:31,791 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 05:57:31,793 INFO  L231             Difference]: Finished difference. Result has 158 places, 184 transitions, 634 flow
[2024-03-09 05:57:31,794 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 05:57:31,794 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 18 predicate places.
[2024-03-09 05:57:31,794 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 184 transitions, 634 flow
[2024-03-09 05:57:31,795 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 05:57:31,795 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:31,795 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 05:57:31,795 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 05:57:31,795 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 05:57:31,795 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:31,795 INFO  L85        PathProgramCache]: Analyzing trace with hash -624336094, now seen corresponding path program 1 times
[2024-03-09 05:57:31,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:31,795 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500216264]
[2024-03-09 05:57:31,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:31,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:31,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:31,954 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 05:57:31,954 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:31,954 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500216264]
[2024-03-09 05:57:31,954 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500216264] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:57:31,954 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:57:31,954 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:57:31,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557219662]
[2024-03-09 05:57:31,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:57:31,955 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:57:31,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:31,955 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:57:31,955 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:57:32,193 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140
[2024-03-09 05:57:32,194 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 05:57:32,194 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:32,194 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140
[2024-03-09 05:57:32,194 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:33,008 INFO  L124   PetriNetUnfolderBase]: 3173/8714 cut-off events.
[2024-03-09 05:57:33,008 INFO  L125   PetriNetUnfolderBase]: For 4364/4375 co-relation queries the response was YES.
[2024-03-09 05:57:33,023 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 05:57:33,049 INFO  L140   encePairwiseOnDemand]: 113/140 looper letters, 78 selfloop transitions, 104 changer transitions 4/300 dead transitions.
[2024-03-09 05:57:33,049 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 300 transitions, 1529 flow
[2024-03-09 05:57:33,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:57:33,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:57:33,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions.
[2024-03-09 05:57:33,051 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8511904761904762
[2024-03-09 05:57:33,051 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 715 transitions.
[2024-03-09 05:57:33,051 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions.
[2024-03-09 05:57:33,052 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:33,052 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions.
[2024-03-09 05:57:33,053 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 05:57:33,054 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 05:57:33,054 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 05:57:33,054 INFO  L175             Difference]: Start difference. First operand has 158 places, 184 transitions, 634 flow. Second operand 6 states and 715 transitions.
[2024-03-09 05:57:33,054 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 300 transitions, 1529 flow
[2024-03-09 05:57:33,061 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 05:57:33,063 INFO  L231             Difference]: Finished difference. Result has 167 places, 284 transitions, 1638 flow
[2024-03-09 05:57:33,064 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 05:57:33,065 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 27 predicate places.
[2024-03-09 05:57:33,065 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 284 transitions, 1638 flow
[2024-03-09 05:57:33,065 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 05:57:33,065 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:33,065 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 05:57:33,065 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 05:57:33,065 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 05:57:33,066 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:33,066 INFO  L85        PathProgramCache]: Analyzing trace with hash 737051974, now seen corresponding path program 1 times
[2024-03-09 05:57:33,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:33,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300381172]
[2024-03-09 05:57:33,066 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:33,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:33,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:33,240 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 05:57:33,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:33,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300381172]
[2024-03-09 05:57:33,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300381172] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:57:33,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:57:33,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:57:33,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209882187]
[2024-03-09 05:57:33,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:57:33,241 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:57:33,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:33,242 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:57:33,242 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:57:33,379 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140
[2024-03-09 05:57:33,379 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 05:57:33,379 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:33,379 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140
[2024-03-09 05:57:33,379 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:35,816 INFO  L124   PetriNetUnfolderBase]: 8591/20092 cut-off events.
[2024-03-09 05:57:35,817 INFO  L125   PetriNetUnfolderBase]: For 22443/24839 co-relation queries the response was YES.
[2024-03-09 05:57:35,854 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 05:57:35,916 INFO  L140   encePairwiseOnDemand]: 105/140 looper letters, 173 selfloop transitions, 249 changer transitions 0/525 dead transitions.
[2024-03-09 05:57:35,917 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 525 transitions, 3950 flow
[2024-03-09 05:57:35,917 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:57:35,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:57:35,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions.
[2024-03-09 05:57:35,919 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8845238095238095
[2024-03-09 05:57:35,919 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 743 transitions.
[2024-03-09 05:57:35,919 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions.
[2024-03-09 05:57:35,919 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:35,919 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions.
[2024-03-09 05:57:35,920 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 05:57:35,921 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 05:57:35,922 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 05:57:35,922 INFO  L175             Difference]: Start difference. First operand has 167 places, 284 transitions, 1638 flow. Second operand 6 states and 743 transitions.
[2024-03-09 05:57:35,922 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 525 transitions, 3950 flow
[2024-03-09 05:57:35,951 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 05:57:35,956 INFO  L231             Difference]: Finished difference. Result has 171 places, 517 transitions, 4284 flow
[2024-03-09 05:57:35,956 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 05:57:35,957 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 31 predicate places.
[2024-03-09 05:57:35,957 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 517 transitions, 4284 flow
[2024-03-09 05:57:35,957 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 05:57:35,957 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:35,957 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 05:57:35,957 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-09 05:57:35,958 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 05:57:35,958 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:35,958 INFO  L85        PathProgramCache]: Analyzing trace with hash 2127204244, now seen corresponding path program 1 times
[2024-03-09 05:57:35,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:35,958 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614183056]
[2024-03-09 05:57:35,958 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:35,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:35,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:36,261 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 05:57:36,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:36,262 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614183056]
[2024-03-09 05:57:36,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614183056] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:57:36,262 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791237145]
[2024-03-09 05:57:36,262 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:36,262 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:57:36,262 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:57:36,263 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 05:57:36,269 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 05:57:36,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:36,397 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 39 conjunts are in the unsatisfiable core
[2024-03-09 05:57:36,400 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:57:36,403 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 05:57:36,413 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:57:36,413 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 05:57:36,493 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 05:57:36,496 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 05:57:36,673 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 05:57:36,694 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 05:57:36,723 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 05:57:36,783 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 30 treesize of output 21
[2024-03-09 05:57:36,808 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:57:36,808 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 3 case distinctions, treesize of input 33 treesize of output 38
[2024-03-09 05:57:36,839 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 05:57:36,840 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:57:36,862 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-09 05:57:36,877 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_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_579 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_579) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-09 05:57:36,975 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 05:57:36,980 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 8 treesize of output 4
[2024-03-09 05:57:36,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 05:57:36,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791237145] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:57:36,996 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:57:36,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 28
[2024-03-09 05:57:36,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693534575]
[2024-03-09 05:57:36,997 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:57:36,997 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-03-09 05:57:36,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:36,998 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-03-09 05:57:36,998 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=615, Unknown=2, NotChecked=102, Total=812
[2024-03-09 05:57:37,040 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 140
[2024-03-09 05:57:37,043 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 517 transitions, 4284 flow. Second operand  has 29 states, 29 states have (on average 53.724137931034484) internal successors, (1558), 29 states have internal predecessors, (1558), 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 05:57:37,043 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:37,043 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 140
[2024-03-09 05:57:37,043 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:57:47,125 INFO  L124   PetriNetUnfolderBase]: 28923/54633 cut-off events.
[2024-03-09 05:57:47,125 INFO  L125   PetriNetUnfolderBase]: For 97612/97623 co-relation queries the response was YES.
[2024-03-09 05:57:47,267 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 191087 conditions, 54633 events. 28923/54633 cut-off events. For 97612/97623 co-relation queries the response was YES. Maximal size of possible extension queue 1490. Compared 513194 event pairs, 3533 based on Foata normal form. 365/52462 useless extension candidates. Maximal degree in co-relation 154238. Up to 22273 conditions per place. 
[2024-03-09 05:57:47,460 INFO  L140   encePairwiseOnDemand]: 100/140 looper letters, 894 selfloop transitions, 672 changer transitions 3/1620 dead transitions.
[2024-03-09 05:57:47,461 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1620 transitions, 16072 flow
[2024-03-09 05:57:47,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2024-03-09 05:57:47,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2024-03-09 05:57:47,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2291 transitions.
[2024-03-09 05:57:47,465 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4958874458874459
[2024-03-09 05:57:47,465 INFO  L72            ComplementDD]: Start complementDD. Operand 33 states and 2291 transitions.
[2024-03-09 05:57:47,465 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 33 states and 2291 transitions.
[2024-03-09 05:57:47,466 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:57:47,466 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2291 transitions.
[2024-03-09 05:57:47,469 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 34 states, 33 states have (on average 69.42424242424242) internal successors, (2291), 33 states have internal predecessors, (2291), 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 05:57:47,473 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 34 states, 34 states have (on average 140.0) internal successors, (4760), 34 states have internal predecessors, (4760), 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 05:57:47,474 INFO  L81            ComplementDD]: Finished complementDD. Result  has 34 states, 34 states have (on average 140.0) internal successors, (4760), 34 states have internal predecessors, (4760), 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 05:57:47,474 INFO  L175             Difference]: Start difference. First operand has 171 places, 517 transitions, 4284 flow. Second operand 33 states and 2291 transitions.
[2024-03-09 05:57:47,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1620 transitions, 16072 flow
[2024-03-09 05:57:48,724 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 1620 transitions, 15982 flow, removed 45 selfloop flow, removed 0 redundant places.
[2024-03-09 05:57:48,739 INFO  L231             Difference]: Finished difference. Result has 225 places, 1106 transitions, 13135 flow
[2024-03-09 05:57:48,740 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=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=13135, PETRI_PLACES=225, PETRI_TRANSITIONS=1106}
[2024-03-09 05:57:48,740 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 85 predicate places.
[2024-03-09 05:57:48,741 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 1106 transitions, 13135 flow
[2024-03-09 05:57:48,741 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 53.724137931034484) internal successors, (1558), 29 states have internal predecessors, (1558), 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 05:57:48,741 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:57:48,741 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 05:57:48,748 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 05:57:48,942 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 05:57:48,943 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 05:57:48,944 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:57:48,944 INFO  L85        PathProgramCache]: Analyzing trace with hash 875036247, now seen corresponding path program 1 times
[2024-03-09 05:57:48,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:57:48,945 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797446676]
[2024-03-09 05:57:48,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:48,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:57:48,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:49,284 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 05:57:49,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:57:49,285 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797446676]
[2024-03-09 05:57:49,285 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797446676] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:57:49,285 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411180204]
[2024-03-09 05:57:49,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:57:49,285 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:57:49,285 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:57:49,286 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 05:57:49,287 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 05:57:49,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:57:49,397 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-09 05:57:49,399 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:57:49,408 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 05:57:49,431 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-09 05:57:49,431 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 05:57:49,479 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 05:57:49,615 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 05:57:49,644 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 05:57:49,676 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 05:57:49,718 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 05:57:49,846 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 05:57:49,881 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 05:57:49,881 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:57:49,902 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0))) is different from false
[2024-03-09 05:57:49,955 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |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 05:57:49,969 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_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)))) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0))))) is different from false
[2024-03-09 05:57:49,991 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_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_680) |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 05:57:50,068 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 05:57:50,090 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 05:57:50,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411180204] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:57:50,091 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:57:50,091 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30
[2024-03-09 05:57:50,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225448092]
[2024-03-09 05:57:50,092 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:57:50,093 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-03-09 05:57:50,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:57:50,095 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-03-09 05:57:50,095 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=605, Unknown=4, NotChecked=212, Total=930
[2024-03-09 05:57:50,190 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 140
[2024-03-09 05:57:50,191 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 1106 transitions, 13135 flow. Second operand  has 31 states, 31 states have (on average 61.29032258064516) internal successors, (1900), 31 states have internal predecessors, (1900), 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 05:57:50,192 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:57:50,192 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 140
[2024-03-09 05:57:50,192 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:58:04,021 INFO  L124   PetriNetUnfolderBase]: 28653/54818 cut-off events.
[2024-03-09 05:58:04,021 INFO  L125   PetriNetUnfolderBase]: For 222544/222599 co-relation queries the response was YES.
[2024-03-09 05:58:04,312 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 241230 conditions, 54818 events. 28653/54818 cut-off events. For 222544/222599 co-relation queries the response was YES. Maximal size of possible extension queue 1520. Compared 511490 event pairs, 4444 based on Foata normal form. 166/52116 useless extension candidates. Maximal degree in co-relation 236018. Up to 17675 conditions per place. 
[2024-03-09 05:58:04,525 INFO  L140   encePairwiseOnDemand]: 108/140 looper letters, 1158 selfloop transitions, 777 changer transitions 0/2003 dead transitions.
[2024-03-09 05:58:04,525 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2003 transitions, 25951 flow
[2024-03-09 05:58:04,526 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2024-03-09 05:58:04,526 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2024-03-09 05:58:04,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2136 transitions.
[2024-03-09 05:58:04,528 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5448979591836735
[2024-03-09 05:58:04,528 INFO  L72            ComplementDD]: Start complementDD. Operand 28 states and 2136 transitions.
[2024-03-09 05:58:04,528 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 2136 transitions.
[2024-03-09 05:58:04,528 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:58:04,528 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2136 transitions.
[2024-03-09 05:58:04,531 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 29 states, 28 states have (on average 76.28571428571429) internal successors, (2136), 28 states have internal predecessors, (2136), 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 05:58:04,534 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 29 states, 29 states have (on average 140.0) internal successors, (4060), 29 states have internal predecessors, (4060), 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 05:58:04,535 INFO  L81            ComplementDD]: Finished complementDD. Result  has 29 states, 29 states have (on average 140.0) internal successors, (4060), 29 states have internal predecessors, (4060), 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 05:58:04,535 INFO  L175             Difference]: Start difference. First operand has 225 places, 1106 transitions, 13135 flow. Second operand 28 states and 2136 transitions.
[2024-03-09 05:58:04,535 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 2003 transitions, 25951 flow
[2024-03-09 05:58:09,367 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 2003 transitions, 25840 flow, removed 50 selfloop flow, removed 5 redundant places.
[2024-03-09 05:58:09,390 INFO  L231             Difference]: Finished difference. Result has 264 places, 1478 transitions, 21494 flow
[2024-03-09 05:58:09,391 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=13025, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=420, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=21494, PETRI_PLACES=264, PETRI_TRANSITIONS=1478}
[2024-03-09 05:58:09,391 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 124 predicate places.
[2024-03-09 05:58:09,391 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 1478 transitions, 21494 flow
[2024-03-09 05:58:09,392 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 61.29032258064516) internal successors, (1900), 31 states have internal predecessors, (1900), 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 05:58:09,392 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:58:09,392 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 05:58:09,399 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 05:58:09,593 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 05:58:09,593 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 05:58:09,594 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:58:09,594 INFO  L85        PathProgramCache]: Analyzing trace with hash -29121676, now seen corresponding path program 1 times
[2024-03-09 05:58:09,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:58:09,594 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102227842]
[2024-03-09 05:58:09,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:58:09,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:58:09,610 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:58:09,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 05:58:09,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:58:09,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102227842]
[2024-03-09 05:58:09,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102227842] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:58:09,770 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:58:09,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:58:09,770 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171452706]
[2024-03-09 05:58:09,770 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:58:09,770 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:58:09,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:58:09,771 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:58:09,771 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:58:10,082 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140
[2024-03-09 05:58:10,083 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1478 transitions, 21494 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 05:58:10,083 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:58:10,083 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140
[2024-03-09 05:58:10,083 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:58:15,959 INFO  L124   PetriNetUnfolderBase]: 11910/27965 cut-off events.
[2024-03-09 05:58:15,959 INFO  L125   PetriNetUnfolderBase]: For 175561/177552 co-relation queries the response was YES.
[2024-03-09 05:58:16,094 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 136710 conditions, 27965 events. 11910/27965 cut-off events. For 175561/177552 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 274851 event pairs, 957 based on Foata normal form. 241/27299 useless extension candidates. Maximal degree in co-relation 135296. Up to 10897 conditions per place. 
[2024-03-09 05:58:16,202 INFO  L140   encePairwiseOnDemand]: 125/140 looper letters, 1122 selfloop transitions, 180 changer transitions 0/1655 dead transitions.
[2024-03-09 05:58:16,202 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1655 transitions, 26585 flow
[2024-03-09 05:58:16,203 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:58:16,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:58:16,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions.
[2024-03-09 05:58:16,204 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8773809523809524
[2024-03-09 05:58:16,204 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 737 transitions.
[2024-03-09 05:58:16,204 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions.
[2024-03-09 05:58:16,204 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:58:16,204 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions.
[2024-03-09 05:58:16,205 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 05:58:16,206 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 05:58:16,206 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 05:58:16,206 INFO  L175             Difference]: Start difference. First operand has 264 places, 1478 transitions, 21494 flow. Second operand 6 states and 737 transitions.
[2024-03-09 05:58:16,206 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1655 transitions, 26585 flow
[2024-03-09 05:58:18,282 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1655 transitions, 26190 flow, removed 173 selfloop flow, removed 10 redundant places.
[2024-03-09 05:58:18,303 INFO  L231             Difference]: Finished difference. Result has 264 places, 1653 transitions, 24421 flow
[2024-03-09 05:58:18,304 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=21099, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24421, PETRI_PLACES=264, PETRI_TRANSITIONS=1653}
[2024-03-09 05:58:18,304 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 124 predicate places.
[2024-03-09 05:58:18,305 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 1653 transitions, 24421 flow
[2024-03-09 05:58:18,305 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 05:58:18,305 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:58:18,305 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 05:58:18,305 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-09 05:58:18,305 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 05:58:18,305 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:58:18,305 INFO  L85        PathProgramCache]: Analyzing trace with hash 1272654483, now seen corresponding path program 1 times
[2024-03-09 05:58:18,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:58:18,306 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673528155]
[2024-03-09 05:58:18,306 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:58:18,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:58:18,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:58:18,638 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 05:58:18,638 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:58:18,638 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673528155]
[2024-03-09 05:58:18,638 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673528155] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:58:18,638 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244260153]
[2024-03-09 05:58:18,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:58:18,638 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:58:18,639 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:58:18,639 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 05:58:18,644 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 05:58:18,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:58:18,776 INFO  L262         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 37 conjunts are in the unsatisfiable core
[2024-03-09 05:58:18,782 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:58:19,059 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 05:58:19,335 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 05:58:19,379 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 05:58:19,425 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 05:58:19,482 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 05:58:19,556 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:58:19,556 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 05:58:19,597 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 05:58:19,597 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:58:19,616 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-09 05:58:19,629 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_823 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-09 05:58:19,645 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ 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) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-09 05:58:19,904 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 05:58:19,908 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 8 treesize of output 4
[2024-03-09 05:58:19,981 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 05:58:19,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244260153] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:58:19,981 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:58:19,981 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 15] total 41
[2024-03-09 05:58:19,981 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259054748]
[2024-03-09 05:58:19,981 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:58:19,982 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-03-09 05:58:19,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:58:19,983 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-03-09 05:58:19,983 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1336, Unknown=3, NotChecked=228, Total=1722
[2024-03-09 05:58:20,197 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 42 out of 140
[2024-03-09 05:58:20,199 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 1653 transitions, 24421 flow. Second operand  has 42 states, 42 states have (on average 44.976190476190474) internal successors, (1889), 42 states have internal predecessors, (1889), 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 05:58:20,199 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:58:20,199 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 140
[2024-03-09 05:58:20,199 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:58:45,010 INFO  L124   PetriNetUnfolderBase]: 37784/70513 cut-off events.
[2024-03-09 05:58:45,010 INFO  L125   PetriNetUnfolderBase]: For 432215/432421 co-relation queries the response was YES.
[2024-03-09 05:58:45,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 350230 conditions, 70513 events. 37784/70513 cut-off events. For 432215/432421 co-relation queries the response was YES. Maximal size of possible extension queue 1882. Compared 669608 event pairs, 8746 based on Foata normal form. 717/68128 useless extension candidates. Maximal degree in co-relation 346420. Up to 36035 conditions per place. 
[2024-03-09 05:58:45,957 INFO  L140   encePairwiseOnDemand]: 95/140 looper letters, 1849 selfloop transitions, 980 changer transitions 4/2889 dead transitions.
[2024-03-09 05:58:45,957 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 2889 transitions, 43546 flow
[2024-03-09 05:58:45,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 
[2024-03-09 05:58:45,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 39 states.
[2024-03-09 05:58:45,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2284 transitions.
[2024-03-09 05:58:45,960 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4183150183150183
[2024-03-09 05:58:45,960 INFO  L72            ComplementDD]: Start complementDD. Operand 39 states and 2284 transitions.
[2024-03-09 05:58:45,960 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 39 states and 2284 transitions.
[2024-03-09 05:58:45,960 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:58:45,960 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2284 transitions.
[2024-03-09 05:58:45,963 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 40 states, 39 states have (on average 58.56410256410256) internal successors, (2284), 39 states have internal predecessors, (2284), 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 05:58:45,967 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 40 states, 40 states have (on average 140.0) internal successors, (5600), 40 states have internal predecessors, (5600), 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 05:58:45,967 INFO  L81            ComplementDD]: Finished complementDD. Result  has 40 states, 40 states have (on average 140.0) internal successors, (5600), 40 states have internal predecessors, (5600), 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 05:58:45,967 INFO  L175             Difference]: Start difference. First operand has 264 places, 1653 transitions, 24421 flow. Second operand 39 states and 2284 transitions.
[2024-03-09 05:58:45,967 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 2889 transitions, 43546 flow
[2024-03-09 05:58:56,890 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 2889 transitions, 43394 flow, removed 76 selfloop flow, removed 0 redundant places.
[2024-03-09 05:58:56,924 INFO  L231             Difference]: Finished difference. Result has 318 places, 2261 transitions, 37160 flow
[2024-03-09 05:58:56,925 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=24269, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=520, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1031, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=37160, PETRI_PLACES=318, PETRI_TRANSITIONS=2261}
[2024-03-09 05:58:56,926 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 178 predicate places.
[2024-03-09 05:58:56,926 INFO  L495      AbstractCegarLoop]: Abstraction has has 318 places, 2261 transitions, 37160 flow
[2024-03-09 05:58:56,926 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 44.976190476190474) internal successors, (1889), 42 states have internal predecessors, (1889), 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 05:58:56,926 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:58:56,926 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 05:58:56,931 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 05:58:57,127 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 05:58:57,132 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 05:58:57,132 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:58:57,132 INFO  L85        PathProgramCache]: Analyzing trace with hash 2067666975, now seen corresponding path program 1 times
[2024-03-09 05:58:57,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:58:57,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315299998]
[2024-03-09 05:58:57,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:58:57,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:58:57,152 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:58:57,469 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 05:58:57,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:58:57,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315299998]
[2024-03-09 05:58:57,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315299998] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:58:57,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191207667]
[2024-03-09 05:58:57,470 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:58:57,470 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:58:57,470 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:58:57,471 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 05:58:57,476 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 05:58:57,598 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:58:57,599 INFO  L262         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjunts are in the unsatisfiable core
[2024-03-09 05:58:57,602 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:58:57,682 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 05:58:57,882 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 05:58:57,928 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 05:58:57,970 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 05:58:58,031 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 05:58:58,085 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:58:58,086 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 05:58:58,124 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 05:58:58,124 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:58:58,144 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |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 05:58:58,159 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_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false
[2024-03-09 05:58:58,177 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 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|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2024-03-09 05:58:58,346 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 05:58:58,392 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 05:58:58,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [191207667] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:58:58,393 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:58:58,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34
[2024-03-09 05:58:58,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532297815]
[2024-03-09 05:58:58,393 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:58:58,393 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-03-09 05:58:58,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:58:58,394 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-03-09 05:58:58,394 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=877, Unknown=3, NotChecked=186, Total=1190
[2024-03-09 05:58:58,477 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 140
[2024-03-09 05:58:58,480 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 2261 transitions, 37160 flow. Second operand  has 35 states, 35 states have (on average 62.65714285714286) internal successors, (2193), 35 states have internal predecessors, (2193), 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 05:58:58,480 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:58:58,480 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 140
[2024-03-09 05:58:58,480 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:59:26,320 INFO  L124   PetriNetUnfolderBase]: 38864/73395 cut-off events.
[2024-03-09 05:59:26,320 INFO  L125   PetriNetUnfolderBase]: For 703639/704837 co-relation queries the response was YES.
[2024-03-09 05:59:27,144 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 440355 conditions, 73395 events. 38864/73395 cut-off events. For 703639/704837 co-relation queries the response was YES. Maximal size of possible extension queue 1966. Compared 706106 event pairs, 5048 based on Foata normal form. 542/70473 useless extension candidates. Maximal degree in co-relation 436221. Up to 24642 conditions per place. 
[2024-03-09 05:59:27,561 INFO  L140   encePairwiseOnDemand]: 107/140 looper letters, 2026 selfloop transitions, 1307 changer transitions 0/3437 dead transitions.
[2024-03-09 05:59:27,561 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 3437 transitions, 60110 flow
[2024-03-09 05:59:27,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-03-09 05:59:27,562 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-03-09 05:59:27,563 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1680 transitions.
[2024-03-09 05:59:27,564 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-03-09 05:59:27,564 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1680 transitions.
[2024-03-09 05:59:27,564 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1680 transitions.
[2024-03-09 05:59:27,564 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:59:27,565 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1680 transitions.
[2024-03-09 05:59:27,566 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 80.0) internal successors, (1680), 21 states have internal predecessors, (1680), 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 05:59:27,568 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 140.0) internal successors, (3080), 22 states have internal predecessors, (3080), 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 05:59:27,569 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 140.0) internal successors, (3080), 22 states have internal predecessors, (3080), 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 05:59:27,569 INFO  L175             Difference]: Start difference. First operand has 318 places, 2261 transitions, 37160 flow. Second operand 21 states and 1680 transitions.
[2024-03-09 05:59:27,569 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 3437 transitions, 60110 flow
[2024-03-09 05:59:51,940 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 3437 transitions, 59764 flow, removed 152 selfloop flow, removed 17 redundant places.
[2024-03-09 05:59:51,984 INFO  L231             Difference]: Finished difference. Result has 330 places, 2841 transitions, 52704 flow
[2024-03-09 05:59:51,986 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=36830, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=796, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=52704, PETRI_PLACES=330, PETRI_TRANSITIONS=2841}
[2024-03-09 05:59:51,987 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 190 predicate places.
[2024-03-09 05:59:51,987 INFO  L495      AbstractCegarLoop]: Abstraction has has 330 places, 2841 transitions, 52704 flow
[2024-03-09 05:59:51,987 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 62.65714285714286) internal successors, (2193), 35 states have internal predecessors, (2193), 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 05:59:51,988 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:59:51,988 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 05:59:51,992 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 05:59:52,188 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 05:59:52,189 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 05:59:52,190 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:59:52,190 INFO  L85        PathProgramCache]: Analyzing trace with hash -674251681, now seen corresponding path program 2 times
[2024-03-09 05:59:52,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:59:52,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364698035]
[2024-03-09 05:59:52,191 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:59:52,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:59:52,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:59:52,673 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 05:59:52,673 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:59:52,673 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364698035]
[2024-03-09 05:59:52,673 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364698035] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:59:52,673 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592704635]
[2024-03-09 05:59:52,673 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 05:59:52,673 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:59:52,673 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:59:52,674 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 05:59:52,676 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 05:59:52,826 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:59:52,826 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:59:52,827 INFO  L262         TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 19 conjunts are in the unsatisfiable core
[2024-03-09 05:59:52,829 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:59:52,909 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 26 treesize of output 14
[2024-03-09 05:59:53,087 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 05:59:53,119 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 05:59:53,158 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:59:53,158 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 05:59:53,210 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:59:53,210 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 05:59:53,266 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:59:53,267 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 05:59:53,344 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:59:53,344 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 05:59:53,352 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 05:59:53,353 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:59:53,374 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-09 06:00:14,071 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_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-09 06:00:14,095 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_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1037) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-09 06:00:14,544 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 27 treesize of output 15
[2024-03-09 06:00:14,672 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked.
[2024-03-09 06:00:14,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592704635] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:00:14,672 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:00:14,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38
[2024-03-09 06:00:14,673 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662688266]
[2024-03-09 06:00:14,673 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:00:14,673 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 39 states
[2024-03-09 06:00:14,674 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:00:14,674 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2024-03-09 06:00:14,675 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1113, Unknown=17, NotChecked=210, Total=1482
[2024-03-09 06:00:15,301 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 140
[2024-03-09 06:00:15,303 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 2841 transitions, 52704 flow. Second operand  has 39 states, 39 states have (on average 57.87179487179487) internal successors, (2257), 39 states have internal predecessors, (2257), 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:15,303 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:00:15,303 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 140
[2024-03-09 06:00:15,303 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:01:01,212 INFO  L124   PetriNetUnfolderBase]: 45246/82860 cut-off events.
[2024-03-09 06:01:01,212 INFO  L125   PetriNetUnfolderBase]: For 948792/949188 co-relation queries the response was YES.
[2024-03-09 06:01:02,269 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 530699 conditions, 82860 events. 45246/82860 cut-off events. For 948792/949188 co-relation queries the response was YES. Maximal size of possible extension queue 2075. Compared 783494 event pairs, 5464 based on Foata normal form. 700/79840 useless extension candidates. Maximal degree in co-relation 525600. Up to 26043 conditions per place. 
[2024-03-09 06:01:02,648 INFO  L140   encePairwiseOnDemand]: 112/140 looper letters, 1859 selfloop transitions, 2039 changer transitions 1/3968 dead transitions.
[2024-03-09 06:01:02,648 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 3968 transitions, 75447 flow
[2024-03-09 06:01:02,649 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-03-09 06:01:02,649 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2024-03-09 06:01:02,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2256 transitions.
[2024-03-09 06:01:02,651 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5198156682027649
[2024-03-09 06:01:02,651 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2256 transitions.
[2024-03-09 06:01:02,651 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2256 transitions.
[2024-03-09 06:01:02,651 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:01:02,651 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2256 transitions.
[2024-03-09 06:01:02,654 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 72.7741935483871) internal successors, (2256), 31 states have internal predecessors, (2256), 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,657 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:02,657 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:02,657 INFO  L175             Difference]: Start difference. First operand has 330 places, 2841 transitions, 52704 flow. Second operand 31 states and 2256 transitions.
[2024-03-09 06:01:02,657 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 3968 transitions, 75447 flow
[2024-03-09 06:01:26,166 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 3968 transitions, 75268 flow, removed 63 selfloop flow, removed 10 redundant places.
[2024-03-09 06:01:26,235 INFO  L231             Difference]: Finished difference. Result has 362 places, 3330 transitions, 70354 flow
[2024-03-09 06:01:26,238 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=52549, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1651, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1099, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=70354, PETRI_PLACES=362, PETRI_TRANSITIONS=3330}
[2024-03-09 06:01:26,239 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 222 predicate places.
[2024-03-09 06:01:26,239 INFO  L495      AbstractCegarLoop]: Abstraction has has 362 places, 3330 transitions, 70354 flow
[2024-03-09 06:01:26,239 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 39 states, 39 states have (on average 57.87179487179487) internal successors, (2257), 39 states have internal predecessors, (2257), 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:26,240 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:01:26,240 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:01:26,245 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-09 06:01:26,441 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:01:26,441 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:01:26,442 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:01:26,442 INFO  L85        PathProgramCache]: Analyzing trace with hash 1752028768, now seen corresponding path program 1 times
[2024-03-09 06:01:26,442 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:01:26,442 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624420383]
[2024-03-09 06:01:26,442 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:01:26,443 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:01:26,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:01:26,996 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:26,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:01:26,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624420383]
[2024-03-09 06:01:26,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624420383] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:01:26,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441006835]
[2024-03-09 06:01:26,997 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:01:26,997 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:01:26,998 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:01:26,998 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:01:27,000 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:01:27,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:01:27,090 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 56 conjunts are in the unsatisfiable core
[2024-03-09 06:01:27,093 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:01:27,099 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:27,154 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-09 06:01:27,155 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:01:27,277 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:01:27,292 INFO  L349             Elim1Store]: treesize reduction 13, result has 40.9 percent of original size
[2024-03-09 06:01:27,293 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25
[2024-03-09 06:01:27,383 INFO  L349             Elim1Store]: treesize reduction 4, result has 81.0 percent of original size
[2024-03-09 06:01:27,383 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30
[2024-03-09 06:01:27,668 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:01:28,756 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-03-09 06:01:28,757 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 92 treesize of output 84
[2024-03-09 06:01:29,760 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:01:29,761 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 83 treesize of output 71
[2024-03-09 06:01:29,934 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:29,991 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:30,051 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:30,127 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:30,218 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:30,284 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:30,284 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:01:30,468 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_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1154 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-09 06:01:30,487 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ 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) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1154 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1154 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1154) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-09 06:01:30,615 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1149 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1149) |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:01:30,636 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1149 (Array Int Int))) (not (= (select (select (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_1149) |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:01:30,732 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 8 treesize of output 4
[2024-03-09 06:01:30,742 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1149 (Array Int Int)) (|ULTIMATE.start_main_~#ts~0#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|))) (or (not (= (select (select (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_1149) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) .cse0)) (not (= |c_ULTIMATE.start_main_#t~malloc7#1.base| .cse0))))) is different from false
[2024-03-09 06:01:30,832 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1149 (Array Int Int)) (|v_ULTIMATE.start_main_~#ts~0#1.base_28| Int) (v_ArrVal_1148 Int) (|ULTIMATE.start_main_~#ts~0#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#ts~0#1.base_28|) |ULTIMATE.start_main_~#ts~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~#ts~0#1.base_28| (+ |c_#StackHeapBarrier| 1)) (not (= (select (select (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_1149) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) .cse0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#ts~0#1.base_28| v_ArrVal_1148) .cse0) 0))))) is different from false
[2024-03-09 06:01:30,865 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:01:30,865 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 62 treesize of output 45
[2024-03-09 06:01:30,874 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 20 treesize of output 18
[2024-03-09 06:01:34,917 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (or (not (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~#ts~0#1.base_28| Int) (v_ArrVal_1148 Int) (v_arrayElimCell_99 Int)) (or (< |v_ULTIMATE.start_main_~#ts~0#1.base_28| .cse0) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#ts~0#1.base_28| v_ArrVal_1148) v_arrayElimCell_99) 0))))) (forall ((|v_ULTIMATE.start_main_~#ts~0#1.base_28| Int)) (or (< |v_ULTIMATE.start_main_~#ts~0#1.base_28| .cse0) (forall ((v_ArrVal_1148 Int)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#ts~0#1.base_28| v_ArrVal_1148) |c_ULTIMATE.start_main_#t~malloc6#1.base|) 0))))))) is different from false
[2024-03-09 06:01:35,016 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:35,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [441006835] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:01:35,017 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:01:35,017 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 47
[2024-03-09 06:01:35,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377775927]
[2024-03-09 06:01:35,017 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:01:35,018 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 48 states
[2024-03-09 06:01:35,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:01:35,019 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2024-03-09 06:01:35,020 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1469, Unknown=31, NotChecked=588, Total=2256
[2024-03-09 06:01:35,030 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 140
[2024-03-09 06:01:35,031 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 3330 transitions, 70354 flow. Second operand  has 48 states, 48 states have (on average 47.604166666666664) internal successors, (2285), 48 states have internal predecessors, (2285), 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,031 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:01:35,031 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 140
[2024-03-09 06:01:35,032 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:02:54,839 INFO  L124   PetriNetUnfolderBase]: 65769/119116 cut-off events.
[2024-03-09 06:02:54,840 INFO  L125   PetriNetUnfolderBase]: For 1886574/1886888 co-relation queries the response was YES.
[2024-03-09 06:02:56,645 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 846070 conditions, 119116 events. 65769/119116 cut-off events. For 1886574/1886888 co-relation queries the response was YES. Maximal size of possible extension queue 3234. Compared 1177046 event pairs, 15360 based on Foata normal form. 262/113800 useless extension candidates. Maximal degree in co-relation 843463. Up to 48126 conditions per place. 
[2024-03-09 06:02:57,243 INFO  L140   encePairwiseOnDemand]: 82/140 looper letters, 4547 selfloop transitions, 1139 changer transitions 95/5825 dead transitions.
[2024-03-09 06:02:57,244 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 5825 transitions, 127005 flow
[2024-03-09 06:02:57,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. 
[2024-03-09 06:02:57,245 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2024-03-09 06:02:57,246 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3081 transitions.
[2024-03-09 06:02:57,247 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43151260504201683
[2024-03-09 06:02:57,247 INFO  L72            ComplementDD]: Start complementDD. Operand 51 states and 3081 transitions.
[2024-03-09 06:02:57,248 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 51 states and 3081 transitions.
[2024-03-09 06:02:57,248 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:02:57,248 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 3081 transitions.
[2024-03-09 06:02:57,251 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 52 states, 51 states have (on average 60.411764705882355) internal successors, (3081), 51 states have internal predecessors, (3081), 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:57,256 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 52 states, 52 states have (on average 140.0) internal successors, (7280), 52 states have internal predecessors, (7280), 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:57,257 INFO  L81            ComplementDD]: Finished complementDD. Result  has 52 states, 52 states have (on average 140.0) internal successors, (7280), 52 states have internal predecessors, (7280), 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:57,257 INFO  L175             Difference]: Start difference. First operand has 362 places, 3330 transitions, 70354 flow. Second operand 51 states and 3081 transitions.
[2024-03-09 06:02:57,257 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 5825 transitions, 127005 flow
[2024-03-09 06:04:43,564 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 5825 transitions, 126374 flow, removed 268 selfloop flow, removed 16 redundant places.
[2024-03-09 06:04:43,647 INFO  L231             Difference]: Finished difference. Result has 430 places, 4341 transitions, 97317 flow
[2024-03-09 06:04:43,650 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=69806, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=374, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=97317, PETRI_PLACES=430, PETRI_TRANSITIONS=4341}
[2024-03-09 06:04:43,650 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 290 predicate places.
[2024-03-09 06:04:43,650 INFO  L495      AbstractCegarLoop]: Abstraction has has 430 places, 4341 transitions, 97317 flow
[2024-03-09 06:04:43,651 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 48 states, 48 states have (on average 47.604166666666664) internal successors, (2285), 48 states have internal predecessors, (2285), 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:04:43,651 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:04:43,651 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:04:43,657 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-09 06:04:43,855 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:04:43,856 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:04:43,857 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:04:43,857 INFO  L85        PathProgramCache]: Analyzing trace with hash -1999289416, now seen corresponding path program 2 times
[2024-03-09 06:04:43,857 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:04:43,858 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646925788]
[2024-03-09 06:04:43,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:04:43,858 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:04:43,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:04:45,510 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:04:45,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:04:45,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646925788]
[2024-03-09 06:04:45,511 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646925788] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:04:45,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381403846]
[2024-03-09 06:04:45,511 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 06:04:45,512 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:04:45,512 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:04:45,513 INFO  L229       MonitoredProcess]: Starting monitored process 10 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:04:45,515 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-03-09 06:04:45,709 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 06:04:45,709 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:04:45,711 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 71 conjunts are in the unsatisfiable core
[2024-03-09 06:04:45,717 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:04:45,919 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:04:46,090 INFO  L349             Elim1Store]: treesize reduction 27, result has 25.0 percent of original size
[2024-03-09 06:04:46,090 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 18
[2024-03-09 06:04:46,194 INFO  L349             Elim1Store]: treesize reduction 20, result has 39.4 percent of original size
[2024-03-09 06:04:46,195 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 22
[2024-03-09 06:04:47,433 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-03-09 06:04:47,433 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 78 treesize of output 74
[2024-03-09 06:04:47,452 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:04:47,475 INFO  L349             Elim1Store]: treesize reduction 29, result has 31.0 percent of original size
[2024-03-09 06:04:47,476 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 2 case distinctions, treesize of input 31 treesize of output 29
[2024-03-09 06:04:47,494 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:04:47,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 29 treesize of output 21
[2024-03-09 06:04:48,168 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:04:48,169 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 26 treesize of output 19
[2024-03-09 06:04:48,189 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:04:48,191 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 16 treesize of output 11
[2024-03-09 06:04:48,505 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 25 treesize of output 13
[2024-03-09 06:04:48,511 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:04:48,602 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:04:48,680 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:04:48,755 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:04:48,838 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:04:48,939 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:04:49,012 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:04:49,013 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:04:49,269 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_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1273 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-09 06:04:49,296 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_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1273 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1273) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-09 06:04:49,497 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:04:49,497 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:04:49,503 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:04:49,503 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 68 treesize of output 28
[2024-03-09 06:04:49,514 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:04:49,514 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:04:49,523 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:04:49,524 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:04:49,534 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:04:49,535 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:04:51,301 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:04:51,302 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 127 treesize of output 82
[2024-03-09 06:04:51,314 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 48
[2024-03-09 06:04:51,323 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 48 treesize of output 46
[2024-03-09 06:04:51,349 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:04:51,349 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 17 treesize of output 20
[2024-03-09 06:04:51,633 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:04:51,634 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 41 treesize of output 46
[2024-03-09 06:04:51,791 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:04:51,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381403846] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:04:51,792 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:04:51,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 22] total 67
[2024-03-09 06:04:51,793 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142663686]
[2024-03-09 06:04:51,793 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:04:51,794 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 68 states
[2024-03-09 06:04:51,794 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:04:51,795 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants.
[2024-03-09 06:04:51,797 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=3962, Unknown=33, NotChecked=258, Total=4556
[2024-03-09 06:04:51,835 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 31 out of 140
[2024-03-09 06:04:51,837 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 4341 transitions, 97317 flow. Second operand  has 68 states, 68 states have (on average 33.38235294117647) internal successors, (2270), 68 states have internal predecessors, (2270), 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:04:51,837 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:04:51,837 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 140
[2024-03-09 06:04:51,837 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:06:48,181 INFO  L124   PetriNetUnfolderBase]: 69922/125701 cut-off events.
[2024-03-09 06:06:48,181 INFO  L125   PetriNetUnfolderBase]: For 2847720/2848057 co-relation queries the response was YES.
[2024-03-09 06:06:50,659 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 999224 conditions, 125701 events. 69922/125701 cut-off events. For 2847720/2848057 co-relation queries the response was YES. Maximal size of possible extension queue 3153. Compared 1216951 event pairs, 18505 based on Foata normal form. 73/119947 useless extension candidates. Maximal degree in co-relation 998768. Up to 92481 conditions per place. 
[2024-03-09 06:06:51,320 INFO  L140   encePairwiseOnDemand]: 71/140 looper letters, 4962 selfloop transitions, 944 changer transitions 645/6582 dead transitions.
[2024-03-09 06:06:51,320 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 6582 transitions, 144871 flow
[2024-03-09 06:06:51,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. 
[2024-03-09 06:06:51,321 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 74 states.
[2024-03-09 06:06:51,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 3184 transitions.
[2024-03-09 06:06:51,325 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3073359073359073
[2024-03-09 06:06:51,325 INFO  L72            ComplementDD]: Start complementDD. Operand 74 states and 3184 transitions.
[2024-03-09 06:06:51,325 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 74 states and 3184 transitions.
[2024-03-09 06:06:51,325 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:06:51,326 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 3184 transitions.
[2024-03-09 06:06:51,329 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 75 states, 74 states have (on average 43.027027027027025) internal successors, (3184), 74 states have internal predecessors, (3184), 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:06:51,336 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 75 states, 75 states have (on average 140.0) internal successors, (10500), 75 states have internal predecessors, (10500), 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:06:51,336 INFO  L81            ComplementDD]: Finished complementDD. Result  has 75 states, 75 states have (on average 140.0) internal successors, (10500), 75 states have internal predecessors, (10500), 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:06:51,336 INFO  L175             Difference]: Start difference. First operand has 430 places, 4341 transitions, 97317 flow. Second operand 74 states and 3184 transitions.
[2024-03-09 06:06:51,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 6582 transitions, 144871 flow
[2024-03-09 06:09:02,846 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 6582 transitions, 143394 flow, removed 727 selfloop flow, removed 11 redundant places.
[2024-03-09 06:09:02,945 INFO  L231             Difference]: Finished difference. Result has 525 places, 4658 transitions, 105552 flow
[2024-03-09 06:09:02,948 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=96016, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=643, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=105552, PETRI_PLACES=525, PETRI_TRANSITIONS=4658}
[2024-03-09 06:09:02,948 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 385 predicate places.
[2024-03-09 06:09:02,948 INFO  L495      AbstractCegarLoop]: Abstraction has has 525 places, 4658 transitions, 105552 flow
[2024-03-09 06:09:02,949 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 68 states, 68 states have (on average 33.38235294117647) internal successors, (2270), 68 states have internal predecessors, (2270), 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:09:02,949 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:09:02,949 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:09:02,957 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-09 06:09:03,150 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:09:03,152 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:09:03,152 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:09:03,153 INFO  L85        PathProgramCache]: Analyzing trace with hash 1346493398, now seen corresponding path program 3 times
[2024-03-09 06:09:03,153 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:09:03,153 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769330611]
[2024-03-09 06:09:03,154 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:09:03,154 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:09:03,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:09:04,095 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:09:04,095 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:09:04,095 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769330611]
[2024-03-09 06:09:04,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769330611] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:09:04,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014720665]
[2024-03-09 06:09:04,096 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 06:09:04,096 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:09:04,096 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:09:04,097 INFO  L229       MonitoredProcess]: Starting monitored process 11 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:09:04,099 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-09 06:09:04,230 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 06:09:04,230 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 06:09:04,235 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 59 conjunts are in the unsatisfiable core
[2024-03-09 06:09:04,240 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:09:04,289 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:09:04,420 INFO  L349             Elim1Store]: treesize reduction 27, result has 25.0 percent of original size
[2024-03-09 06:09:04,421 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 18
[2024-03-09 06:09:04,518 INFO  L349             Elim1Store]: treesize reduction 20, result has 39.4 percent of original size
[2024-03-09 06:09:04,519 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 22
[2024-03-09 06:09:04,812 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:09:05,429 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-03-09 06:09:05,429 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:09:05,447 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 23 treesize of output 17
[2024-03-09 06:09:05,825 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:09:05,826 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 26 treesize of output 19
[2024-03-09 06:09:05,874 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:09:05,965 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:09:06,056 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:09:06,174 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:09:06,458 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 25 treesize of output 13
[2024-03-09 06:09:06,550 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:09:06,551 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 37 treesize of output 26
[2024-03-09 06:09:06,598 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:09:06,599 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 37 treesize of output 26
[2024-03-09 06:09:06,637 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:09:06,638 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 37 treesize of output 26
[2024-03-09 06:09:06,670 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 06:09:06,671 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 37 treesize of output 26
[2024-03-09 06:09:06,776 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:09:06,845 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:09:06,845 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:09:06,869 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1394 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1394 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1394 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-09 06:09:06,914 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-09 06:09:06,980 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) .cse0 v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) .cse0 v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) .cse0 v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) .cse0 v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-03-09 06:09:07,344 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ 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) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) .cse1 v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) .cse1 v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) .cse1 v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) .cse1 v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-09 06:09:07,366 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ 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) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) .cse1 v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) .cse1 v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) .cse1 v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1393) .cse1 v_ArrVal_1394) c_threadThread1of2ForFork0_~t~0.base) .cse4)))))) is different from false
[2024-03-09 06:09:07,390 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:09:07,391 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 42 treesize of output 58
[2024-03-09 06:09:07,399 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:09:07,399 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 248 treesize of output 154
[2024-03-09 06:09:07,408 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 21 treesize of output 17
[2024-03-09 06:09:07,413 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 32 treesize of output 24
[2024-03-09 06:09:07,439 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:09:07,440 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2024-03-09 06:09:07,448 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:09:07,449 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-09 06:09:07,461 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 06:09:07,461 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-09 06:09:07,825 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 8 treesize of output 4
[2024-03-09 06:09:08,243 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:09:08,244 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 104 treesize of output 93
[2024-03-09 06:09:08,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 55 treesize of output 53
[2024-03-09 06:09:08,456 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 06:09:08,457 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 41 treesize of output 46
[2024-03-09 06:09:08,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 06:09:08,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014720665] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:09:08,548 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:09:08,549 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 54
[2024-03-09 06:09:08,549 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594084934]
[2024-03-09 06:09:08,549 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:09:08,550 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 55 states
[2024-03-09 06:09:08,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:09:08,551 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants.
[2024-03-09 06:09:08,552 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2223, Unknown=25, NotChecked=500, Total=2970
[2024-03-09 06:09:08,817 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 140
[2024-03-09 06:09:08,819 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 4658 transitions, 105552 flow. Second operand  has 55 states, 55 states have (on average 47.45454545454545) internal successors, (2610), 55 states have internal predecessors, (2610), 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:09:08,819 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:09:08,820 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 140
[2024-03-09 06:09:08,820 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
