./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/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 c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:40:06,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:40:06,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:40:06,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:40:06,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:40:06,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:40:06,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:40:06,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:40:06,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:40:06,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:40:06,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:40:06,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:40:06,360 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:40:06,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:40:06,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:40:06,363 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:40:06,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:40:06,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:40:06,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:40:06,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:40:06,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:40:06,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:40:06,369 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:40:06,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:40:06,369 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:40:06,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:40:06,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:40:06,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:40:06,370 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:40:06,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:40:06,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:40:06,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:40:06,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:40:06,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:40:06,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:40:06,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:40:06,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:40:06,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:40:06,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:40:06,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:40:06,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:40:06,374 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:/storage/repos/ultimate/releaseScripts/default/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 -> /storage/repos/ultimate/releaseScripts/default/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 -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2024-11-10 14:40:06,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:40:06,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:40:06,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:40:06,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:40:06,686 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:40:06,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2024-11-10 14:40:08,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:40:08,288 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:40:08,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2024-11-10 14:40:08,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b18b0f44/1c4a44bb476c461aa0c85ca0ec1eddd9/FLAGdf4707eed [2024-11-10 14:40:08,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b18b0f44/1c4a44bb476c461aa0c85ca0ec1eddd9 [2024-11-10 14:40:08,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:40:08,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:40:08,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:40:08,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:40:08,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:40:08,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:40:08" (1/1) ... [2024-11-10 14:40:08,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7260d90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:08, skipping insertion in model container [2024-11-10 14:40:08,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:40:08" (1/1) ... [2024-11-10 14:40:08,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:40:08,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:40:08,938 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:40:08,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:40:09,005 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:40:09,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09 WrapperNode [2024-11-10 14:40:09,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:40:09,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:40:09,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:40:09,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:40:09,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09" (1/1) ... [2024-11-10 14:40:09,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09" (1/1) ... [2024-11-10 14:40:09,058 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 186 [2024-11-10 14:40:09,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:40:09,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:40:09,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:40:09,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:40:09,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09" (1/1) ... [2024-11-10 14:40:09,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09" (1/1) ... [2024-11-10 14:40:09,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09" (1/1) ... [2024-11-10 14:40:09,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09" (1/1) ... [2024-11-10 14:40:09,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09" (1/1) ... [2024-11-10 14:40:09,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09" (1/1) ... [2024-11-10 14:40:09,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09" (1/1) ... [2024-11-10 14:40:09,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09" (1/1) ... [2024-11-10 14:40:09,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:40:09,095 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:40:09,095 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:40:09,095 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:40:09,096 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09" (1/1) ... [2024-11-10 14:40:09,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:40:09,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:40:09,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:40:09,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:40:09,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:40:09,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:40:09,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:40:09,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:40:09,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:40:09,201 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 14:40:09,201 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 14:40:09,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:40:09,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:40:09,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 14:40:09,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 14:40:09,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:40:09,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:40:09,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:40:09,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:40:09,204 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:40:09,355 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:40:09,360 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:40:09,935 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:40:09,938 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:40:10,036 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:40:10,037 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:40:10,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:10 BoogieIcfgContainer [2024-11-10 14:40:10,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:40:10,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:40:10,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:40:10,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:40:10,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:40:08" (1/3) ... [2024-11-10 14:40:10,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c16f95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:40:10, skipping insertion in model container [2024-11-10 14:40:10,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:09" (2/3) ... [2024-11-10 14:40:10,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c16f95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:40:10, skipping insertion in model container [2024-11-10 14:40:10,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:10" (3/3) ... [2024-11-10 14:40:10,048 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2024-11-10 14:40:10,064 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:40:10,065 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-11-10 14:40:10,065 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:40:10,167 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:40:10,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 337 places, 347 transitions, 715 flow [2024-11-10 14:40:10,351 INFO L124 PetriNetUnfolderBase]: 20/344 cut-off events. [2024-11-10 14:40:10,352 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:40:10,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 344 events. 20/344 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 483 event pairs, 0 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2024-11-10 14:40:10,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 337 places, 347 transitions, 715 flow [2024-11-10 14:40:10,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 318 places, 327 transitions, 672 flow [2024-11-10 14:40:10,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:40:10,393 INFO L333 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, 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;@66bfb18e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:40:10,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-10 14:40:10,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:40:10,401 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-10 14:40:10,401 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:40:10,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:10,402 INFO L204 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] [2024-11-10 14:40:10,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:10,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:10,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1086632390, now seen corresponding path program 1 times [2024-11-10 14:40:10,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:10,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478169071] [2024-11-10 14:40:10,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:10,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:10,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478169071] [2024-11-10 14:40:10,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478169071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:10,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678157248] [2024-11-10 14:40:10,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:10,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:10,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:10,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:10,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:10,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 347 [2024-11-10 14:40:10,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 327 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:10,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:10,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 347 [2024-11-10 14:40:10,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:11,063 INFO L124 PetriNetUnfolderBase]: 85/887 cut-off events. [2024-11-10 14:40:11,064 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-10 14:40:11,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 887 events. 85/887 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4500 event pairs, 51 based on Foata normal form. 9/752 useless extension candidates. Maximal degree in co-relation 759. Up to 134 conditions per place. [2024-11-10 14:40:11,078 INFO L140 encePairwiseOnDemand]: 320/347 looper letters, 18 selfloop transitions, 2 changer transitions 6/302 dead transitions. [2024-11-10 14:40:11,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 302 transitions, 662 flow [2024-11-10 14:40:11,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2024-11-10 14:40:11,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9048991354466859 [2024-11-10 14:40:11,098 INFO L175 Difference]: Start difference. First operand has 318 places, 327 transitions, 672 flow. Second operand 3 states and 942 transitions. [2024-11-10 14:40:11,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 302 transitions, 662 flow [2024-11-10 14:40:11,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 302 transitions, 650 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:40:11,111 INFO L231 Difference]: Finished difference. Result has 301 places, 296 transitions, 602 flow [2024-11-10 14:40:11,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=301, PETRI_TRANSITIONS=296} [2024-11-10 14:40:11,119 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -17 predicate places. [2024-11-10 14:40:11,119 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 296 transitions, 602 flow [2024-11-10 14:40:11,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:11,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:11,121 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:11,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:40:11,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:11,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:11,123 INFO L85 PathProgramCache]: Analyzing trace with hash 150633977, now seen corresponding path program 1 times [2024-11-10 14:40:11,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:11,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967657201] [2024-11-10 14:40:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:11,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967657201] [2024-11-10 14:40:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967657201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:11,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:11,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:11,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225200220] [2024-11-10 14:40:11,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:11,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:11,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:11,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:11,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:11,210 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 347 [2024-11-10 14:40:11,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 296 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:11,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:11,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 347 [2024-11-10 14:40:11,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:11,408 INFO L124 PetriNetUnfolderBase]: 213/998 cut-off events. [2024-11-10 14:40:11,409 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-10 14:40:11,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 998 events. 213/998 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5276 event pairs, 128 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1284. Up to 297 conditions per place. [2024-11-10 14:40:11,418 INFO L140 encePairwiseOnDemand]: 340/347 looper letters, 21 selfloop transitions, 1 changer transitions 0/290 dead transitions. [2024-11-10 14:40:11,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 290 transitions, 634 flow [2024-11-10 14:40:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 907 transitions. [2024-11-10 14:40:11,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8712776176753122 [2024-11-10 14:40:11,422 INFO L175 Difference]: Start difference. First operand has 301 places, 296 transitions, 602 flow. Second operand 3 states and 907 transitions. [2024-11-10 14:40:11,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 290 transitions, 634 flow [2024-11-10 14:40:11,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 290 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:11,427 INFO L231 Difference]: Finished difference. Result has 289 places, 290 transitions, 588 flow [2024-11-10 14:40:11,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=289, PETRI_TRANSITIONS=290} [2024-11-10 14:40:11,429 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -29 predicate places. [2024-11-10 14:40:11,429 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 290 transitions, 588 flow [2024-11-10 14:40:11,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:11,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:11,430 INFO L204 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] [2024-11-10 14:40:11,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:40:11,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:11,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:11,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1681672486, now seen corresponding path program 1 times [2024-11-10 14:40:11,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:11,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285647427] [2024-11-10 14:40:11,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:11,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:12,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285647427] [2024-11-10 14:40:12,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285647427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:40:12,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522410373] [2024-11-10 14:40:12,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:40:12,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:40:12,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:40:12,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 347 [2024-11-10 14:40:12,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 290 transitions, 588 flow. Second operand has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:12,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 347 [2024-11-10 14:40:12,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,728 INFO L124 PetriNetUnfolderBase]: 157/977 cut-off events. [2024-11-10 14:40:12,729 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-10 14:40:12,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 977 events. 157/977 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4915 event pairs, 100 based on Foata normal form. 0/855 useless extension candidates. Maximal degree in co-relation 1254. Up to 263 conditions per place. [2024-11-10 14:40:12,735 INFO L140 encePairwiseOnDemand]: 329/347 looper letters, 41 selfloop transitions, 15 changer transitions 0/287 dead transitions. [2024-11-10 14:40:12,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 287 transitions, 694 flow [2024-11-10 14:40:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:40:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:40:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1631 transitions. [2024-11-10 14:40:12,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7833813640730067 [2024-11-10 14:40:12,740 INFO L175 Difference]: Start difference. First operand has 289 places, 290 transitions, 588 flow. Second operand 6 states and 1631 transitions. [2024-11-10 14:40:12,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 287 transitions, 694 flow [2024-11-10 14:40:12,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 287 transitions, 693 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:12,744 INFO L231 Difference]: Finished difference. Result has 290 places, 287 transitions, 611 flow [2024-11-10 14:40:12,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=611, PETRI_PLACES=290, PETRI_TRANSITIONS=287} [2024-11-10 14:40:12,746 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -28 predicate places. [2024-11-10 14:40:12,747 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 287 transitions, 611 flow [2024-11-10 14:40:12,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:12,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,749 INFO L204 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] [2024-11-10 14:40:12,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:40:12,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:12,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash -768602539, now seen corresponding path program 1 times [2024-11-10 14:40:12,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709427312] [2024-11-10 14:40:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:12,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709427312] [2024-11-10 14:40:12,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709427312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50071416] [2024-11-10 14:40:12,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 347 [2024-11-10 14:40:12,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 287 transitions, 611 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:12,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 347 [2024-11-10 14:40:12,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,889 INFO L124 PetriNetUnfolderBase]: 45/442 cut-off events. [2024-11-10 14:40:12,890 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:40:12,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 442 events. 45/442 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1334 event pairs, 23 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 503. Up to 67 conditions per place. [2024-11-10 14:40:12,893 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 13 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2024-11-10 14:40:12,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 286 transitions, 639 flow [2024-11-10 14:40:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2024-11-10 14:40:12,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8914505283381364 [2024-11-10 14:40:12,896 INFO L175 Difference]: Start difference. First operand has 290 places, 287 transitions, 611 flow. Second operand 3 states and 928 transitions. [2024-11-10 14:40:12,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 286 transitions, 639 flow [2024-11-10 14:40:12,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 286 transitions, 609 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:40:12,901 INFO L231 Difference]: Finished difference. Result has 286 places, 286 transitions, 583 flow [2024-11-10 14:40:12,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=286, PETRI_TRANSITIONS=286} [2024-11-10 14:40:12,902 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -32 predicate places. [2024-11-10 14:40:12,903 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 286 transitions, 583 flow [2024-11-10 14:40:12,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:12,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,904 INFO L204 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, 1, 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-11-10 14:40:12,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:40:12,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:12,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash 119933783, now seen corresponding path program 1 times [2024-11-10 14:40:12,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830053316] [2024-11-10 14:40:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:12,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830053316] [2024-11-10 14:40:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830053316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163972376] [2024-11-10 14:40:12,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 347 [2024-11-10 14:40:12,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 286 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:12,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 347 [2024-11-10 14:40:12,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:13,048 INFO L124 PetriNetUnfolderBase]: 45/441 cut-off events. [2024-11-10 14:40:13,048 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:40:13,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 441 events. 45/441 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1295 event pairs, 23 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 489. Up to 67 conditions per place. [2024-11-10 14:40:13,051 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 13 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2024-11-10 14:40:13,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 285 transitions, 611 flow [2024-11-10 14:40:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2024-11-10 14:40:13,054 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8914505283381364 [2024-11-10 14:40:13,054 INFO L175 Difference]: Start difference. First operand has 286 places, 286 transitions, 583 flow. Second operand 3 states and 928 transitions. [2024-11-10 14:40:13,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 285 transitions, 611 flow [2024-11-10 14:40:13,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 285 transitions, 607 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:13,059 INFO L231 Difference]: Finished difference. Result has 285 places, 285 transitions, 581 flow [2024-11-10 14:40:13,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=285, PETRI_TRANSITIONS=285} [2024-11-10 14:40:13,062 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -33 predicate places. [2024-11-10 14:40:13,062 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 285 transitions, 581 flow [2024-11-10 14:40:13,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:13,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:13,064 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:13,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:40:13,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:13,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:13,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2072545044, now seen corresponding path program 1 times [2024-11-10 14:40:13,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:13,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6938015] [2024-11-10 14:40:13,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:13,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:13,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:13,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6938015] [2024-11-10 14:40:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6938015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:13,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:13,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474331602] [2024-11-10 14:40:13,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:13,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:13,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:13,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:13,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:13,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 347 [2024-11-10 14:40:13,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 285 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:13,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:13,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 347 [2024-11-10 14:40:13,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:13,276 INFO L124 PetriNetUnfolderBase]: 28/355 cut-off events. [2024-11-10 14:40:13,276 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:40:13,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 355 events. 28/355 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 778 event pairs, 12 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 377. Up to 44 conditions per place. [2024-11-10 14:40:13,279 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 12 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2024-11-10 14:40:13,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 284 transitions, 607 flow [2024-11-10 14:40:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2024-11-10 14:40:13,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8933717579250721 [2024-11-10 14:40:13,283 INFO L175 Difference]: Start difference. First operand has 285 places, 285 transitions, 581 flow. Second operand 3 states and 930 transitions. [2024-11-10 14:40:13,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 284 transitions, 607 flow [2024-11-10 14:40:13,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 284 transitions, 603 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:13,289 INFO L231 Difference]: Finished difference. Result has 284 places, 284 transitions, 579 flow [2024-11-10 14:40:13,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=284, PETRI_TRANSITIONS=284} [2024-11-10 14:40:13,290 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -34 predicate places. [2024-11-10 14:40:13,292 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 284 transitions, 579 flow [2024-11-10 14:40:13,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:13,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:13,293 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:13,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:40:13,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:13,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:13,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1367528104, now seen corresponding path program 1 times [2024-11-10 14:40:13,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:13,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554383265] [2024-11-10 14:40:13,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:13,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:13,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:13,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554383265] [2024-11-10 14:40:13,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554383265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:13,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:13,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:13,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685813464] [2024-11-10 14:40:13,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:13,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:13,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:13,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:13,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:13,368 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 347 [2024-11-10 14:40:13,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 284 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:13,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:13,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 347 [2024-11-10 14:40:13,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:13,484 INFO L124 PetriNetUnfolderBase]: 73/578 cut-off events. [2024-11-10 14:40:13,485 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:40:13,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 578 events. 73/578 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2288 event pairs, 23 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 676. Up to 64 conditions per place. [2024-11-10 14:40:13,490 INFO L140 encePairwiseOnDemand]: 342/347 looper letters, 16 selfloop transitions, 3 changer transitions 0/287 dead transitions. [2024-11-10 14:40:13,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 287 transitions, 625 flow [2024-11-10 14:40:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 936 transitions. [2024-11-10 14:40:13,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.899135446685879 [2024-11-10 14:40:13,492 INFO L175 Difference]: Start difference. First operand has 284 places, 284 transitions, 579 flow. Second operand 3 states and 936 transitions. [2024-11-10 14:40:13,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 287 transitions, 625 flow [2024-11-10 14:40:13,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 287 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:13,497 INFO L231 Difference]: Finished difference. Result has 282 places, 282 transitions, 577 flow [2024-11-10 14:40:13,499 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=282, PETRI_TRANSITIONS=282} [2024-11-10 14:40:13,500 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -36 predicate places. [2024-11-10 14:40:13,500 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 282 transitions, 577 flow [2024-11-10 14:40:13,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:13,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:13,501 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:13,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:40:13,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:13,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:13,502 INFO L85 PathProgramCache]: Analyzing trace with hash -65459191, now seen corresponding path program 1 times [2024-11-10 14:40:13,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:13,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279452582] [2024-11-10 14:40:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:13,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:13,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:13,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279452582] [2024-11-10 14:40:13,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279452582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:13,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:13,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:13,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505329303] [2024-11-10 14:40:13,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:13,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:13,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:13,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:13,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:13,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 347 [2024-11-10 14:40:13,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 282 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:13,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:13,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 347 [2024-11-10 14:40:13,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:13,691 INFO L124 PetriNetUnfolderBase]: 76/768 cut-off events. [2024-11-10 14:40:13,691 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-10 14:40:13,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 768 events. 76/768 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3511 event pairs, 8 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 881. Up to 99 conditions per place. [2024-11-10 14:40:13,696 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 19 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2024-11-10 14:40:13,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 290 transitions, 640 flow [2024-11-10 14:40:13,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 946 transitions. [2024-11-10 14:40:13,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9087415946205571 [2024-11-10 14:40:13,699 INFO L175 Difference]: Start difference. First operand has 282 places, 282 transitions, 577 flow. Second operand 3 states and 946 transitions. [2024-11-10 14:40:13,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 290 transitions, 640 flow [2024-11-10 14:40:13,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 290 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:13,706 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 583 flow [2024-11-10 14:40:13,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=282, PETRI_TRANSITIONS=283} [2024-11-10 14:40:13,707 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -36 predicate places. [2024-11-10 14:40:13,708 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 583 flow [2024-11-10 14:40:13,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:13,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:13,709 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:13,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:40:13,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:13,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:13,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1295079284, now seen corresponding path program 1 times [2024-11-10 14:40:13,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:13,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941505915] [2024-11-10 14:40:13,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:13,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:13,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:13,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941505915] [2024-11-10 14:40:13,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941505915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:13,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:13,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 14:40:13,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450792140] [2024-11-10 14:40:13,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:13,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:40:13,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:13,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:40:13,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:40:14,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 347 [2024-11-10 14:40:14,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 583 flow. Second operand has 7 states, 7 states have (on average 283.14285714285717) internal successors, (1982), 7 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:14,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:14,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 347 [2024-11-10 14:40:14,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:14,857 INFO L124 PetriNetUnfolderBase]: 193/1409 cut-off events. [2024-11-10 14:40:14,857 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-11-10 14:40:14,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 1409 events. 193/1409 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6811 event pairs, 96 based on Foata normal form. 9/1328 useless extension candidates. Maximal degree in co-relation 1908. Up to 201 conditions per place. [2024-11-10 14:40:14,866 INFO L140 encePairwiseOnDemand]: 318/347 looper letters, 52 selfloop transitions, 42 changer transitions 0/334 dead transitions. [2024-11-10 14:40:14,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 334 transitions, 891 flow [2024-11-10 14:40:14,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 14:40:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 14:40:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2882 transitions. [2024-11-10 14:40:14,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8305475504322767 [2024-11-10 14:40:14,872 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 583 flow. Second operand 10 states and 2882 transitions. [2024-11-10 14:40:14,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 334 transitions, 891 flow [2024-11-10 14:40:14,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 334 transitions, 891 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:14,878 INFO L231 Difference]: Finished difference. Result has 295 places, 308 transitions, 775 flow [2024-11-10 14:40:14,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=775, PETRI_PLACES=295, PETRI_TRANSITIONS=308} [2024-11-10 14:40:14,879 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -23 predicate places. [2024-11-10 14:40:14,880 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 308 transitions, 775 flow [2024-11-10 14:40:14,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 283.14285714285717) internal successors, (1982), 7 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:14,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:14,881 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:14,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:40:14,882 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:14,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:14,882 INFO L85 PathProgramCache]: Analyzing trace with hash 902327102, now seen corresponding path program 1 times [2024-11-10 14:40:14,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:14,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731311445] [2024-11-10 14:40:14,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:14,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:14,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:14,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731311445] [2024-11-10 14:40:14,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731311445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:14,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:14,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:14,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441370377] [2024-11-10 14:40:14,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:14,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:14,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:14,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:14,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:14,945 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 347 [2024-11-10 14:40:14,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 308 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:14,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:14,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 347 [2024-11-10 14:40:14,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:15,112 INFO L124 PetriNetUnfolderBase]: 81/947 cut-off events. [2024-11-10 14:40:15,112 INFO L125 PetriNetUnfolderBase]: For 76/78 co-relation queries the response was YES. [2024-11-10 14:40:15,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 947 events. 81/947 cut-off events. For 76/78 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3548 event pairs, 30 based on Foata normal form. 0/897 useless extension candidates. Maximal degree in co-relation 1199. Up to 112 conditions per place. [2024-11-10 14:40:15,118 INFO L140 encePairwiseOnDemand]: 345/347 looper letters, 11 selfloop transitions, 1 changer transitions 0/307 dead transitions. [2024-11-10 14:40:15,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 307 transitions, 797 flow [2024-11-10 14:40:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 939 transitions. [2024-11-10 14:40:15,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9020172910662824 [2024-11-10 14:40:15,121 INFO L175 Difference]: Start difference. First operand has 295 places, 308 transitions, 775 flow. Second operand 3 states and 939 transitions. [2024-11-10 14:40:15,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 307 transitions, 797 flow [2024-11-10 14:40:15,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 307 transitions, 797 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:15,127 INFO L231 Difference]: Finished difference. Result has 296 places, 307 transitions, 775 flow [2024-11-10 14:40:15,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=296, PETRI_TRANSITIONS=307} [2024-11-10 14:40:15,128 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -22 predicate places. [2024-11-10 14:40:15,128 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 307 transitions, 775 flow [2024-11-10 14:40:15,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:15,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:15,129 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:15,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:40:15,129 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:15,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1056515353, now seen corresponding path program 1 times [2024-11-10 14:40:15,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:15,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6825630] [2024-11-10 14:40:15,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:15,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:15,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:15,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6825630] [2024-11-10 14:40:15,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6825630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:15,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:15,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:15,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746859394] [2024-11-10 14:40:15,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:15,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:15,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:15,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:15,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:15,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 347 [2024-11-10 14:40:15,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 307 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 307.6666666666667) internal successors, (923), 3 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:15,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:15,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 347 [2024-11-10 14:40:15,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:15,390 INFO L124 PetriNetUnfolderBase]: 128/1073 cut-off events. [2024-11-10 14:40:15,390 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-11-10 14:40:15,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 1073 events. 128/1073 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4540 event pairs, 37 based on Foata normal form. 4/1019 useless extension candidates. Maximal degree in co-relation 1434. Up to 136 conditions per place. [2024-11-10 14:40:15,398 INFO L140 encePairwiseOnDemand]: 342/347 looper letters, 15 selfloop transitions, 2 changer transitions 28/310 dead transitions. [2024-11-10 14:40:15,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 310 transitions, 823 flow [2024-11-10 14:40:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2024-11-10 14:40:15,401 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8981748318924111 [2024-11-10 14:40:15,401 INFO L175 Difference]: Start difference. First operand has 296 places, 307 transitions, 775 flow. Second operand 3 states and 935 transitions. [2024-11-10 14:40:15,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 310 transitions, 823 flow [2024-11-10 14:40:15,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 310 transitions, 822 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:15,408 INFO L231 Difference]: Finished difference. Result has 295 places, 277 transitions, 650 flow [2024-11-10 14:40:15,408 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=295, PETRI_TRANSITIONS=277} [2024-11-10 14:40:15,409 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -23 predicate places. [2024-11-10 14:40:15,409 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 277 transitions, 650 flow [2024-11-10 14:40:15,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.6666666666667) internal successors, (923), 3 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:15,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:15,410 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:15,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:40:15,411 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:15,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash 826394189, now seen corresponding path program 1 times [2024-11-10 14:40:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:15,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126859327] [2024-11-10 14:40:15,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:15,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:40:15,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:15,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126859327] [2024-11-10 14:40:15,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126859327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:15,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:15,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:40:15,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905911161] [2024-11-10 14:40:15,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:15,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:40:16,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:16,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:40:16,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:40:16,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 347 [2024-11-10 14:40:16,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 277 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 292.5) internal successors, (1755), 6 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:16,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:16,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 347 [2024-11-10 14:40:16,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:16,741 INFO L124 PetriNetUnfolderBase]: 228/1368 cut-off events. [2024-11-10 14:40:16,741 INFO L125 PetriNetUnfolderBase]: For 162/169 co-relation queries the response was YES. [2024-11-10 14:40:16,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 1368 events. 228/1368 cut-off events. For 162/169 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 8188 event pairs, 74 based on Foata normal form. 0/1274 useless extension candidates. Maximal degree in co-relation 1984. Up to 282 conditions per place. [2024-11-10 14:40:16,754 INFO L140 encePairwiseOnDemand]: 339/347 looper letters, 47 selfloop transitions, 10 changer transitions 0/302 dead transitions. [2024-11-10 14:40:16,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 302 transitions, 830 flow [2024-11-10 14:40:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:40:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:40:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1791 transitions. [2024-11-10 14:40:16,758 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8602305475504323 [2024-11-10 14:40:16,758 INFO L175 Difference]: Start difference. First operand has 295 places, 277 transitions, 650 flow. Second operand 6 states and 1791 transitions. [2024-11-10 14:40:16,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 302 transitions, 830 flow [2024-11-10 14:40:16,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 302 transitions, 774 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-11-10 14:40:16,765 INFO L231 Difference]: Finished difference. Result has 285 places, 286 transitions, 674 flow [2024-11-10 14:40:16,766 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=674, PETRI_PLACES=285, PETRI_TRANSITIONS=286} [2024-11-10 14:40:16,767 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -33 predicate places. [2024-11-10 14:40:16,767 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 286 transitions, 674 flow [2024-11-10 14:40:16,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 292.5) internal successors, (1755), 6 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:16,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:16,768 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:16,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:40:16,769 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:16,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1801061105, now seen corresponding path program 1 times [2024-11-10 14:40:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:16,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557623468] [2024-11-10 14:40:16,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:16,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:40:16,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:16,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557623468] [2024-11-10 14:40:16,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557623468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:16,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:16,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:16,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251029825] [2024-11-10 14:40:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:16,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:16,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:16,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:16,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:16,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 347 [2024-11-10 14:40:16,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 286 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:16,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:16,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 347 [2024-11-10 14:40:16,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:17,173 INFO L124 PetriNetUnfolderBase]: 282/1470 cut-off events. [2024-11-10 14:40:17,174 INFO L125 PetriNetUnfolderBase]: For 807/819 co-relation queries the response was YES. [2024-11-10 14:40:17,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2458 conditions, 1470 events. 282/1470 cut-off events. For 807/819 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8654 event pairs, 84 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2420. Up to 293 conditions per place. [2024-11-10 14:40:17,189 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 22 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-11-10 14:40:17,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 291 transitions, 744 flow [2024-11-10 14:40:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 934 transitions. [2024-11-10 14:40:17,192 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8972142170989433 [2024-11-10 14:40:17,193 INFO L175 Difference]: Start difference. First operand has 285 places, 286 transitions, 674 flow. Second operand 3 states and 934 transitions. [2024-11-10 14:40:17,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 291 transitions, 744 flow [2024-11-10 14:40:17,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 291 transitions, 734 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:17,199 INFO L231 Difference]: Finished difference. Result has 286 places, 285 transitions, 668 flow [2024-11-10 14:40:17,200 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=286, PETRI_TRANSITIONS=285} [2024-11-10 14:40:17,201 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -32 predicate places. [2024-11-10 14:40:17,201 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 285 transitions, 668 flow [2024-11-10 14:40:17,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:17,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:17,202 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:17,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:40:17,202 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:17,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:17,203 INFO L85 PathProgramCache]: Analyzing trace with hash -79101518, now seen corresponding path program 1 times [2024-11-10 14:40:17,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:17,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228520190] [2024-11-10 14:40:17,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:17,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:40:17,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:17,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228520190] [2024-11-10 14:40:17,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228520190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:17,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:17,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:17,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753174466] [2024-11-10 14:40:17,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:17,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:17,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:17,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:17,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 347 [2024-11-10 14:40:17,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 285 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:17,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:17,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 347 [2024-11-10 14:40:17,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:17,516 INFO L124 PetriNetUnfolderBase]: 201/1251 cut-off events. [2024-11-10 14:40:17,516 INFO L125 PetriNetUnfolderBase]: For 426/436 co-relation queries the response was YES. [2024-11-10 14:40:17,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1979 conditions, 1251 events. 201/1251 cut-off events. For 426/436 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6956 event pairs, 4 based on Foata normal form. 0/1176 useless extension candidates. Maximal degree in co-relation 1940. Up to 227 conditions per place. [2024-11-10 14:40:17,529 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 21 selfloop transitions, 7 changer transitions 0/296 dead transitions. [2024-11-10 14:40:17,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 296 transitions, 770 flow [2024-11-10 14:40:17,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 944 transitions. [2024-11-10 14:40:17,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9068203650336215 [2024-11-10 14:40:17,532 INFO L175 Difference]: Start difference. First operand has 286 places, 285 transitions, 668 flow. Second operand 3 states and 944 transitions. [2024-11-10 14:40:17,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 296 transitions, 770 flow [2024-11-10 14:40:17,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 296 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:17,538 INFO L231 Difference]: Finished difference. Result has 286 places, 290 transitions, 727 flow [2024-11-10 14:40:17,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=727, PETRI_PLACES=286, PETRI_TRANSITIONS=290} [2024-11-10 14:40:17,539 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, -32 predicate places. [2024-11-10 14:40:17,539 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 290 transitions, 727 flow [2024-11-10 14:40:17,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:17,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:17,541 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:17,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:40:17,541 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:17,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:17,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1879296716, now seen corresponding path program 1 times [2024-11-10 14:40:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:17,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637940076] [2024-11-10 14:40:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:40:18,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:18,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637940076] [2024-11-10 14:40:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637940076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:18,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-10 14:40:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321536663] [2024-11-10 14:40:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:18,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 14:40:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:18,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 14:40:18,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-11-10 14:40:21,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 347 [2024-11-10 14:40:21,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 290 transitions, 727 flow. Second operand has 21 states, 21 states have (on average 258.5238095238095) internal successors, (5429), 21 states have internal predecessors, (5429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:21,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:21,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 347 [2024-11-10 14:40:21,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:23,739 INFO L124 PetriNetUnfolderBase]: 996/4432 cut-off events. [2024-11-10 14:40:23,739 INFO L125 PetriNetUnfolderBase]: For 1897/2007 co-relation queries the response was YES. [2024-11-10 14:40:23,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7786 conditions, 4432 events. 996/4432 cut-off events. For 1897/2007 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 37528 event pairs, 221 based on Foata normal form. 44/4151 useless extension candidates. Maximal degree in co-relation 7743. Up to 547 conditions per place. [2024-11-10 14:40:23,778 INFO L140 encePairwiseOnDemand]: 312/347 looper letters, 98 selfloop transitions, 53 changer transitions 0/365 dead transitions. [2024-11-10 14:40:23,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 365 transitions, 1382 flow [2024-11-10 14:40:23,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 14:40:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-11-10 14:40:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 8563 transitions. [2024-11-10 14:40:23,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7477949524059034 [2024-11-10 14:40:23,793 INFO L175 Difference]: Start difference. First operand has 286 places, 290 transitions, 727 flow. Second operand 33 states and 8563 transitions. [2024-11-10 14:40:23,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 365 transitions, 1382 flow [2024-11-10 14:40:23,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 365 transitions, 1382 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:23,803 INFO L231 Difference]: Finished difference. Result has 323 places, 315 transitions, 1039 flow [2024-11-10 14:40:23,803 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1039, PETRI_PLACES=323, PETRI_TRANSITIONS=315} [2024-11-10 14:40:23,804 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 5 predicate places. [2024-11-10 14:40:23,805 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 315 transitions, 1039 flow [2024-11-10 14:40:23,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 258.5238095238095) internal successors, (5429), 21 states have internal predecessors, (5429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:23,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:23,807 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:23,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:40:23,807 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:23,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1139088146, now seen corresponding path program 2 times [2024-11-10 14:40:23,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:23,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114827259] [2024-11-10 14:40:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:23,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:40:25,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:25,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114827259] [2024-11-10 14:40:25,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114827259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:25,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:25,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-10 14:40:25,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775328749] [2024-11-10 14:40:25,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:25,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 14:40:25,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:25,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 14:40:25,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-11-10 14:40:27,460 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 347 [2024-11-10 14:40:27,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 315 transitions, 1039 flow. Second operand has 20 states, 20 states have (on average 259.6) internal successors, (5192), 20 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:27,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:27,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 347 [2024-11-10 14:40:27,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:29,526 INFO L124 PetriNetUnfolderBase]: 1192/5349 cut-off events. [2024-11-10 14:40:29,527 INFO L125 PetriNetUnfolderBase]: For 5530/5751 co-relation queries the response was YES. [2024-11-10 14:40:29,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10953 conditions, 5349 events. 1192/5349 cut-off events. For 5530/5751 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 47979 event pairs, 309 based on Foata normal form. 162/5138 useless extension candidates. Maximal degree in co-relation 10904. Up to 842 conditions per place. [2024-11-10 14:40:29,585 INFO L140 encePairwiseOnDemand]: 312/347 looper letters, 87 selfloop transitions, 74 changer transitions 0/377 dead transitions. [2024-11-10 14:40:29,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 377 transitions, 1732 flow [2024-11-10 14:40:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 14:40:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-11-10 14:40:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 8590 transitions. [2024-11-10 14:40:29,600 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.750152825080779 [2024-11-10 14:40:29,601 INFO L175 Difference]: Start difference. First operand has 323 places, 315 transitions, 1039 flow. Second operand 33 states and 8590 transitions. [2024-11-10 14:40:29,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 377 transitions, 1732 flow [2024-11-10 14:40:29,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 377 transitions, 1681 flow, removed 0 selfloop flow, removed 26 redundant places. [2024-11-10 14:40:29,619 INFO L231 Difference]: Finished difference. Result has 334 places, 343 transitions, 1437 flow [2024-11-10 14:40:29,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1437, PETRI_PLACES=334, PETRI_TRANSITIONS=343} [2024-11-10 14:40:29,620 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 16 predicate places. [2024-11-10 14:40:29,621 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 343 transitions, 1437 flow [2024-11-10 14:40:29,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 259.6) internal successors, (5192), 20 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:29,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:29,624 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:29,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:40:29,625 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:29,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:29,625 INFO L85 PathProgramCache]: Analyzing trace with hash -246676747, now seen corresponding path program 1 times [2024-11-10 14:40:29,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:29,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296417474] [2024-11-10 14:40:29,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:29,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:40:30,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:30,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296417474] [2024-11-10 14:40:30,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296417474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:30,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:30,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:40:30,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008203530] [2024-11-10 14:40:30,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:30,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:40:30,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:30,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:40:30,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:40:30,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 347 [2024-11-10 14:40:30,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 343 transitions, 1437 flow. Second operand has 6 states, 6 states have (on average 292.5) internal successors, (1755), 6 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:30,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:30,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 347 [2024-11-10 14:40:30,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:31,608 INFO L124 PetriNetUnfolderBase]: 1556/6214 cut-off events. [2024-11-10 14:40:31,608 INFO L125 PetriNetUnfolderBase]: For 10618/10747 co-relation queries the response was YES. [2024-11-10 14:40:31,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14329 conditions, 6214 events. 1556/6214 cut-off events. For 10618/10747 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 56236 event pairs, 378 based on Foata normal form. 81/5917 useless extension candidates. Maximal degree in co-relation 14278. Up to 1231 conditions per place. [2024-11-10 14:40:31,784 INFO L140 encePairwiseOnDemand]: 339/347 looper letters, 76 selfloop transitions, 23 changer transitions 0/376 dead transitions. [2024-11-10 14:40:31,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 376 transitions, 1803 flow [2024-11-10 14:40:31,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:40:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:40:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1791 transitions. [2024-11-10 14:40:31,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8602305475504323 [2024-11-10 14:40:31,787 INFO L175 Difference]: Start difference. First operand has 334 places, 343 transitions, 1437 flow. Second operand 6 states and 1791 transitions. [2024-11-10 14:40:31,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 376 transitions, 1803 flow [2024-11-10 14:40:31,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 376 transitions, 1720 flow, removed 16 selfloop flow, removed 26 redundant places. [2024-11-10 14:40:31,814 INFO L231 Difference]: Finished difference. Result has 318 places, 360 transitions, 1598 flow [2024-11-10 14:40:31,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1598, PETRI_PLACES=318, PETRI_TRANSITIONS=360} [2024-11-10 14:40:31,815 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 0 predicate places. [2024-11-10 14:40:31,815 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 360 transitions, 1598 flow [2024-11-10 14:40:31,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 292.5) internal successors, (1755), 6 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:31,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:31,816 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:31,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:40:31,817 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:31,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:31,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1026433098, now seen corresponding path program 1 times [2024-11-10 14:40:31,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:31,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735804123] [2024-11-10 14:40:31,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:31,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:40:32,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735804123] [2024-11-10 14:40:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735804123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:40:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193115245] [2024-11-10 14:40:32,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:32,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:40:32,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:40:32,196 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:40:32,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:40:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:32,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 14:40:32,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:40:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:40:32,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:40:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:40:33,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193115245] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:40:33,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:40:33,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-10 14:40:33,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939446477] [2024-11-10 14:40:33,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:40:33,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 14:40:33,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:33,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 14:40:33,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-11-10 14:40:34,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 347 [2024-11-10 14:40:34,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 360 transitions, 1598 flow. Second operand has 24 states, 24 states have (on average 270.125) internal successors, (6483), 24 states have internal predecessors, (6483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:34,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:34,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 347 [2024-11-10 14:40:34,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:36,839 INFO L124 PetriNetUnfolderBase]: 3199/11021 cut-off events. [2024-11-10 14:40:36,839 INFO L125 PetriNetUnfolderBase]: For 22613/24151 co-relation queries the response was YES. [2024-11-10 14:40:36,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27380 conditions, 11021 events. 3199/11021 cut-off events. For 22613/24151 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 105814 event pairs, 1187 based on Foata normal form. 536/11027 useless extension candidates. Maximal degree in co-relation 27324. Up to 2771 conditions per place. [2024-11-10 14:40:37,078 INFO L140 encePairwiseOnDemand]: 305/347 looper letters, 147 selfloop transitions, 95 changer transitions 0/503 dead transitions. [2024-11-10 14:40:37,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 503 transitions, 2756 flow [2024-11-10 14:40:37,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 14:40:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-10 14:40:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6305 transitions. [2024-11-10 14:40:37,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7900012529758176 [2024-11-10 14:40:37,107 INFO L175 Difference]: Start difference. First operand has 318 places, 360 transitions, 1598 flow. Second operand 23 states and 6305 transitions. [2024-11-10 14:40:37,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 503 transitions, 2756 flow [2024-11-10 14:40:37,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 503 transitions, 2724 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:37,176 INFO L231 Difference]: Finished difference. Result has 353 places, 424 transitions, 2215 flow [2024-11-10 14:40:37,179 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2215, PETRI_PLACES=353, PETRI_TRANSITIONS=424} [2024-11-10 14:40:37,179 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 35 predicate places. [2024-11-10 14:40:37,180 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 424 transitions, 2215 flow [2024-11-10 14:40:37,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 270.125) internal successors, (6483), 24 states have internal predecessors, (6483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:37,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:37,184 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:37,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:40:37,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 14:40:37,386 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:37,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:37,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1770321225, now seen corresponding path program 1 times [2024-11-10 14:40:37,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:37,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43337445] [2024-11-10 14:40:37,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:37,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:40:37,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:37,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43337445] [2024-11-10 14:40:37,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43337445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:37,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:37,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:37,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652719500] [2024-11-10 14:40:37,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:37,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:37,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:37,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:37,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:37,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 347 [2024-11-10 14:40:37,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 424 transitions, 2215 flow. Second operand has 3 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:37,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:37,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 347 [2024-11-10 14:40:37,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:39,654 INFO L124 PetriNetUnfolderBase]: 2575/10888 cut-off events. [2024-11-10 14:40:39,655 INFO L125 PetriNetUnfolderBase]: For 21904/22303 co-relation queries the response was YES. [2024-11-10 14:40:39,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27539 conditions, 10888 events. 2575/10888 cut-off events. For 21904/22303 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 107729 event pairs, 881 based on Foata normal form. 65/10486 useless extension candidates. Maximal degree in co-relation 27468. Up to 2140 conditions per place. [2024-11-10 14:40:39,766 INFO L140 encePairwiseOnDemand]: 344/347 looper letters, 44 selfloop transitions, 2 changer transitions 0/430 dead transitions. [2024-11-10 14:40:39,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 430 transitions, 2343 flow [2024-11-10 14:40:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 934 transitions. [2024-11-10 14:40:39,768 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8972142170989433 [2024-11-10 14:40:39,769 INFO L175 Difference]: Start difference. First operand has 353 places, 424 transitions, 2215 flow. Second operand 3 states and 934 transitions. [2024-11-10 14:40:39,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 430 transitions, 2343 flow [2024-11-10 14:40:39,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 430 transitions, 2311 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:39,852 INFO L231 Difference]: Finished difference. Result has 353 places, 423 transitions, 2185 flow [2024-11-10 14:40:39,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2181, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2185, PETRI_PLACES=353, PETRI_TRANSITIONS=423} [2024-11-10 14:40:39,853 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 35 predicate places. [2024-11-10 14:40:39,854 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 423 transitions, 2185 flow [2024-11-10 14:40:39,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:39,855 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:39,855 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:39,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:40:39,855 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:39,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:39,856 INFO L85 PathProgramCache]: Analyzing trace with hash 576284772, now seen corresponding path program 1 times [2024-11-10 14:40:39,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:39,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393994555] [2024-11-10 14:40:39,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:39,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:40:40,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:40,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393994555] [2024-11-10 14:40:40,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393994555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:40,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:40,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 14:40:40,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246297084] [2024-11-10 14:40:40,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:41,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 14:40:41,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 14:40:41,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-10 14:40:42,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 347 [2024-11-10 14:40:42,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 423 transitions, 2185 flow. Second operand has 15 states, 15 states have (on average 264.2) internal successors, (3963), 15 states have internal predecessors, (3963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:42,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:42,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 347 [2024-11-10 14:40:42,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:43,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([853] L51-6-->L51-5: Formula: (let ((.cse0 (select |v_#race_1| v_~B~0.base_1)) (.cse1 (* v_thread1Thread1of1ForFork0_~i~0_33 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_1 1)) 0) (= (select .cse0 (+ 2 .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ 3 .cse1 v_~B~0.offset_1)) 0))) InVars {#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} OutVars{#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} AuxVars[] AssignedVars[][360], [Black: 378#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 572#true, Black: 1898#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), Black: 574#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), Black: 1900#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1)), Black: 575#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 1922#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 1920#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 576#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 1892#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1936#true, Black: 1914#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), 1991#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| ~B~0.base)) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset)) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (= (select (select |#race| ~B~0.base) ~B~0.offset) 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 1)) 0) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 1910#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), 210#L78-2true, Black: 591#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), 366#(= |#race~A~0| 0), 345#(= |#race~N~0| 0), Black: 1904#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 1894#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1902#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1)), Black: 1184#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 395#true, Black: 397#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), Black: 398#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 399#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), 245#L96-1true, 82#L65true, Black: 409#true, 485#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 577#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), 411#(= |#race~B~0| 0), 29#L51-5true, Black: 477#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 479#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 483#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 481#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 564#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 364#true, 400#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 560#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 556#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 590#(<= ~N~0 1), Black: 558#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 562#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)))]) [2024-11-10 14:40:43,278 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is not cut-off event [2024-11-10 14:40:43,278 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-11-10 14:40:43,278 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is not cut-off event [2024-11-10 14:40:43,279 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-11-10 14:40:44,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([853] L51-6-->L51-5: Formula: (let ((.cse0 (select |v_#race_1| v_~B~0.base_1)) (.cse1 (* v_thread1Thread1of1ForFork0_~i~0_33 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_1 1)) 0) (= (select .cse0 (+ 2 .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ 3 .cse1 v_~B~0.offset_1)) 0))) InVars {#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} OutVars{#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} AuxVars[] AssignedVars[][360], [Black: 378#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 572#true, Black: 1898#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), 583#true, Black: 574#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), Black: 1900#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1)), Black: 575#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 1922#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 1920#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 576#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 1892#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1936#true, Black: 1914#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), 1991#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| ~B~0.base)) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset)) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (= (select (select |#race| ~B~0.base) ~B~0.offset) 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 1)) 0) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 1910#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 591#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), 366#(= |#race~A~0| 0), 345#(= |#race~N~0| 0), Black: 1904#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 1894#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1902#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1)), Black: 590#(<= ~N~0 1), Black: 1184#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 395#true, Black: 397#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), Black: 398#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 399#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), 245#L96-1true, Black: 409#true, 82#L65true, 485#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 577#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), 224#thread3ENTRYtrue, 411#(= |#race~B~0| 0), 29#L51-5true, Black: 477#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 479#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 483#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 481#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 564#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 364#true, 400#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 560#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 556#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 558#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 562#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)))]) [2024-11-10 14:40:44,116 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2024-11-10 14:40:44,116 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-10 14:40:44,116 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-10 14:40:44,117 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-10 14:40:44,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([853] L51-6-->L51-5: Formula: (let ((.cse0 (select |v_#race_1| v_~B~0.base_1)) (.cse1 (* v_thread1Thread1of1ForFork0_~i~0_33 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_1 1)) 0) (= (select .cse0 (+ 2 .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ 3 .cse1 v_~B~0.offset_1)) 0))) InVars {#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} OutVars{#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} AuxVars[] AssignedVars[][360], [Black: 378#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 572#true, Black: 1898#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), Black: 574#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), 583#true, Black: 1900#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1)), Black: 575#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 1922#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 1920#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 576#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 1892#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1936#true, Black: 1914#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), 1991#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| ~B~0.base)) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset)) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (= (select (select |#race| ~B~0.base) ~B~0.offset) 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 1)) 0) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 1910#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), 366#(= |#race~A~0| 0), Black: 591#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), 345#(= |#race~N~0| 0), Black: 1904#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 1894#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1902#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1)), Black: 590#(<= ~N~0 1), Black: 1184#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 395#true, Black: 397#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), Black: 398#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 399#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), 245#L96-1true, Black: 409#true, 82#L65true, 485#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 577#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), 29#L51-5true, 411#(= |#race~B~0| 0), Black: 477#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 479#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 483#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 481#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 364#true, 564#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 400#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), 200#L74true, Black: 560#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 556#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 558#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 562#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)))]) [2024-11-10 14:40:44,465 INFO L294 olderBase$Statistics]: this new event has 281 ancestors and is not cut-off event [2024-11-10 14:40:44,465 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is not cut-off event [2024-11-10 14:40:44,465 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is not cut-off event [2024-11-10 14:40:44,465 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is not cut-off event [2024-11-10 14:40:44,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([853] L51-6-->L51-5: Formula: (let ((.cse0 (select |v_#race_1| v_~B~0.base_1)) (.cse1 (* v_thread1Thread1of1ForFork0_~i~0_33 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_1 1)) 0) (= (select .cse0 (+ 2 .cse1 v_~B~0.offset_1)) 0) (= (select .cse0 (+ 3 .cse1 v_~B~0.offset_1)) 0))) InVars {#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} OutVars{#race=|v_#race_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, ~B~0.base=v_~B~0.base_1, ~B~0.offset=v_~B~0.offset_1} AuxVars[] AssignedVars[][360], [Black: 378#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 572#true, Black: 1898#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), Black: 574#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), 583#true, Black: 1900#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1)), Black: 575#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 1922#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 1920#(and (= |thread2Thread1of1ForFork2_#t~post10| 0) (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 576#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), Black: 1892#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1936#true, Black: 1914#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1) (= |ULTIMATE.start_create_fresh_uint_array_#t~post31#1| 0)), 1991#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| ~B~0.base)) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset)) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (= (select (select |#race| ~B~0.base) ~B~0.offset) 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 1)) 0) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 1910#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), 210#L78-2true, 366#(= |#race~A~0| 0), Black: 591#(and (<= ~N~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), 345#(= |#race~N~0| 0), Black: 1904#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= ~N~0 1)), Black: 1894#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 1902#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= ~N~0 1)), Black: 590#(<= ~N~0 1), Black: 1184#(and (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 395#true, Black: 397#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0), Black: 398#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 399#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), 245#L96-1true, Black: 409#true, 82#L65true, 485#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 577#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0)), 29#L51-5true, 411#(= |#race~B~0| 0), Black: 477#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 479#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 483#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 481#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 364#true, 564#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), 400#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0)), Black: 560#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 556#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 558#(and (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|))), Black: 562#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= 1 (select |#valid| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (not (= ~A~0.base ~B~0.base)) (= thread1Thread1of1ForFork0_~i~0 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0) (= thread2Thread1of1ForFork2_~i~1 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)))]) [2024-11-10 14:40:44,508 INFO L294 olderBase$Statistics]: this new event has 283 ancestors and is not cut-off event [2024-11-10 14:40:44,508 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is not cut-off event [2024-11-10 14:40:44,508 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is not cut-off event [2024-11-10 14:40:44,508 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is not cut-off event [2024-11-10 14:40:45,179 INFO L124 PetriNetUnfolderBase]: 3590/12970 cut-off events. [2024-11-10 14:40:45,179 INFO L125 PetriNetUnfolderBase]: For 31236/32309 co-relation queries the response was YES. [2024-11-10 14:40:45,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32600 conditions, 12970 events. 3590/12970 cut-off events. For 31236/32309 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 127271 event pairs, 793 based on Foata normal form. 505/12499 useless extension candidates. Maximal degree in co-relation 32525. Up to 2164 conditions per place. [2024-11-10 14:40:45,298 INFO L140 encePairwiseOnDemand]: 315/347 looper letters, 144 selfloop transitions, 75 changer transitions 1/498 dead transitions. [2024-11-10 14:40:45,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 498 transitions, 3172 flow [2024-11-10 14:40:45,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 14:40:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-10 14:40:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 6362 transitions. [2024-11-10 14:40:45,309 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7639289145052833 [2024-11-10 14:40:45,309 INFO L175 Difference]: Start difference. First operand has 353 places, 423 transitions, 2185 flow. Second operand 24 states and 6362 transitions. [2024-11-10 14:40:45,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 498 transitions, 3172 flow [2024-11-10 14:40:45,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 498 transitions, 3168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:45,383 INFO L231 Difference]: Finished difference. Result has 378 places, 435 transitions, 2554 flow [2024-11-10 14:40:45,383 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2181, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2554, PETRI_PLACES=378, PETRI_TRANSITIONS=435} [2024-11-10 14:40:45,384 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 60 predicate places. [2024-11-10 14:40:45,384 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 435 transitions, 2554 flow [2024-11-10 14:40:45,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 264.2) internal successors, (3963), 15 states have internal predecessors, (3963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:45,385 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:45,385 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:45,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:40:45,386 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:45,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:45,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1102864490, now seen corresponding path program 2 times [2024-11-10 14:40:45,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:45,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335101255] [2024-11-10 14:40:45,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:45,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:40:47,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:47,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335101255] [2024-11-10 14:40:47,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335101255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:47,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:47,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-10 14:40:47,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422451978] [2024-11-10 14:40:47,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:47,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 14:40:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:47,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 14:40:47,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-10 14:40:48,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 347 [2024-11-10 14:40:48,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 435 transitions, 2554 flow. Second operand has 21 states, 21 states have (on average 259.5238095238095) internal successors, (5450), 21 states have internal predecessors, (5450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:48,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:48,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 347 [2024-11-10 14:40:48,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:52,471 INFO L124 PetriNetUnfolderBase]: 3150/13254 cut-off events. [2024-11-10 14:40:52,471 INFO L125 PetriNetUnfolderBase]: For 42170/43595 co-relation queries the response was YES. [2024-11-10 14:40:52,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37704 conditions, 13254 events. 3150/13254 cut-off events. For 42170/43595 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 134858 event pairs, 827 based on Foata normal form. 794/13826 useless extension candidates. Maximal degree in co-relation 37624. Up to 2631 conditions per place. [2024-11-10 14:40:52,607 INFO L140 encePairwiseOnDemand]: 312/347 looper letters, 129 selfloop transitions, 92 changer transitions 0/495 dead transitions. [2024-11-10 14:40:52,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 495 transitions, 3505 flow [2024-11-10 14:40:52,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-10 14:40:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-10 14:40:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 8325 transitions. [2024-11-10 14:40:52,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7497298270893372 [2024-11-10 14:40:52,620 INFO L175 Difference]: Start difference. First operand has 378 places, 435 transitions, 2554 flow. Second operand 32 states and 8325 transitions. [2024-11-10 14:40:52,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 495 transitions, 3505 flow [2024-11-10 14:40:52,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 495 transitions, 3430 flow, removed 1 selfloop flow, removed 19 redundant places. [2024-11-10 14:40:52,730 INFO L231 Difference]: Finished difference. Result has 392 places, 448 transitions, 2901 flow [2024-11-10 14:40:52,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2482, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2901, PETRI_PLACES=392, PETRI_TRANSITIONS=448} [2024-11-10 14:40:52,731 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 74 predicate places. [2024-11-10 14:40:52,731 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 448 transitions, 2901 flow [2024-11-10 14:40:52,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 259.5238095238095) internal successors, (5450), 21 states have internal predecessors, (5450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:52,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:52,733 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:52,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 14:40:52,734 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:52,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1231333993, now seen corresponding path program 1 times [2024-11-10 14:40:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:52,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55614683] [2024-11-10 14:40:52,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:40:53,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:53,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55614683] [2024-11-10 14:40:53,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55614683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:40:53,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480514565] [2024-11-10 14:40:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:53,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:40:53,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:40:53,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:40:53,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 14:40:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:53,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 14:40:53,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:40:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:40:53,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:40:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:40:54,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480514565] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:40:54,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:40:54,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-10 14:40:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443144413] [2024-11-10 14:40:54,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:40:54,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 14:40:54,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:54,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 14:40:54,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-11-10 14:40:55,422 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 347 [2024-11-10 14:40:55,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 448 transitions, 2901 flow. Second operand has 24 states, 24 states have (on average 270.0) internal successors, (6480), 24 states have internal predecessors, (6480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:55,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:55,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 347 [2024-11-10 14:40:55,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:58,169 INFO L124 PetriNetUnfolderBase]: 2305/11265 cut-off events. [2024-11-10 14:40:58,169 INFO L125 PetriNetUnfolderBase]: For 36478/36687 co-relation queries the response was YES. [2024-11-10 14:40:58,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32370 conditions, 11265 events. 2305/11265 cut-off events. For 36478/36687 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 111020 event pairs, 641 based on Foata normal form. 113/11090 useless extension candidates. Maximal degree in co-relation 32289. Up to 1689 conditions per place. [2024-11-10 14:40:58,258 INFO L140 encePairwiseOnDemand]: 305/347 looper letters, 96 selfloop transitions, 41 changer transitions 163/561 dead transitions. [2024-11-10 14:40:58,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 561 transitions, 4498 flow [2024-11-10 14:40:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 14:40:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-10 14:40:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6309 transitions. [2024-11-10 14:40:58,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7905024433028442 [2024-11-10 14:40:58,263 INFO L175 Difference]: Start difference. First operand has 392 places, 448 transitions, 2901 flow. Second operand 23 states and 6309 transitions. [2024-11-10 14:40:58,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 561 transitions, 4498 flow [2024-11-10 14:40:58,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 561 transitions, 4324 flow, removed 19 selfloop flow, removed 28 redundant places. [2024-11-10 14:40:58,373 INFO L231 Difference]: Finished difference. Result has 391 places, 386 transitions, 2341 flow [2024-11-10 14:40:58,374 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2709, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2341, PETRI_PLACES=391, PETRI_TRANSITIONS=386} [2024-11-10 14:40:58,374 INFO L277 CegarLoopForPetriNet]: 318 programPoint places, 73 predicate places. [2024-11-10 14:40:58,374 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 386 transitions, 2341 flow [2024-11-10 14:40:58,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 270.0) internal successors, (6480), 24 states have internal predecessors, (6480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:58,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:58,376 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:40:58,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 14:40:58,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-10 14:40:58,578 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-10 14:40:58,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:58,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2009174601, now seen corresponding path program 2 times [2024-11-10 14:40:58,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:58,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579280573] [2024-11-10 14:40:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-10 14:41:00,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:00,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579280573] [2024-11-10 14:41:00,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579280573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:41:00,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865225387] [2024-11-10 14:41:00,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:41:00,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:41:00,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:41:00,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:41:00,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 14:41:01,169 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:41:01,169 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:41:01,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-10 14:41:01,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:41:01,278 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-11-10 14:41:01,816 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 14:41:01,816 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-11-10 14:41:02,631 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 14:41:02,631 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 16 treesize of output 18 [2024-11-10 14:41:03,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 14:41:03,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 14:41:03,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-10 14:41:03,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-10 14:41:03,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 30 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 82 [2024-11-10 14:41:03,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2024-11-10 14:41:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-10 14:41:03,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:41:03,869 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse2 (* c_thread2Thread1of1ForFork2_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0)))) (.cse1 (* c_thread1Thread1of1ForFork0_~i~0 4))) (and (forall ((v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_1097) c_~C~0.base v_ArrVal_1094) c_~A~0.base) (+ c_~A~0.offset 3 .cse1)) 0)) (forall ((v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_1097) c_~C~0.base v_ArrVal_1094) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) 0)) (forall ((v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_1097) c_~C~0.base v_ArrVal_1094) c_~A~0.base) (+ c_~A~0.offset 2 .cse1)) 0)) (forall ((v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_1097) c_~C~0.base v_ArrVal_1094) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)))) is different from false [2024-11-10 14:41:04,620 INFO L349 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2024-11-10 14:41:04,620 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 8 case distinctions, treesize of input 85 treesize of output 121 [2024-11-10 14:41:04,631 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-10 14:41:04,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 95 [2024-11-10 14:41:04,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2024-11-10 14:41:04,641 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 34 [2024-11-10 14:41:04,677 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-11-10 14:41:04,679 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 8 case distinctions, treesize of input 85 treesize of output 1 [2024-11-10 14:41:04,700 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-11-10 14:41:04,700 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 8 case distinctions, treesize of input 85 treesize of output 1 [2024-11-10 14:41:04,721 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-11-10 14:41:04,721 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 8 case distinctions, treesize of input 84 treesize of output 1 [2024-11-10 14:41:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 4 not checked. [2024-11-10 14:41:07,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865225387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:41:07,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:41:07,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 36, 28] total 81 [2024-11-10 14:41:07,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740376325] [2024-11-10 14:41:07,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:41:07,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2024-11-10 14:41:07,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:07,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2024-11-10 14:41:07,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=5976, Unknown=84, NotChecked=158, Total=6642 [2024-11-10 14:41:07,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 347 [2024-11-10 14:41:07,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 386 transitions, 2341 flow. Second operand has 82 states, 82 states have (on average 147.6951219512195) internal successors, (12111), 82 states have internal predecessors, (12111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:41:07,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:07,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 347 [2024-11-10 14:41:07,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand