./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:16:26,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:16:26,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:16:26,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:16:26,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:16:26,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:16:26,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:16:26,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:16:26,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:16:26,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:16:26,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:16:26,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:16:26,611 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:16:26,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:16:26,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:16:26,614 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:16:26,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:16:26,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:16:26,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:16:26,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:16:26,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:16:26,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:16:26,620 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:16:26,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:16:26,620 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:16:26,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:16:26,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:16:26,621 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:16:26,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:16:26,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:16:26,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:16:26,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:16:26,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:16:26,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:16:26,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:16:26,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:16:26,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:16:26,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:16:26,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:16:26,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:16:26,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:16:26,627 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-clean/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-clean/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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2024-10-11 17:16:26,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:16:26,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:16:26,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:16:26,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:16:26,920 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:16:26,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-10-11 17:16:28,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:16:28,591 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:16:28,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-10-11 17:16:28,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6b9601516/22f461d338ab4492afca033061fb3b08/FLAGe1616aed6 [2024-10-11 17:16:28,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6b9601516/22f461d338ab4492afca033061fb3b08 [2024-10-11 17:16:28,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:16:28,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:16:28,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:16:28,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:16:28,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:16:28,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:16:28" (1/1) ... [2024-10-11 17:16:28,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb0310f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:28, skipping insertion in model container [2024-10-11 17:16:28,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:16:28" (1/1) ... [2024-10-11 17:16:29,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:16:29,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:16:29,266 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:16:29,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:16:29,337 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:16:29,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29 WrapperNode [2024-10-11 17:16:29,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:16:29,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:16:29,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:16:29,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:16:29,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29" (1/1) ... [2024-10-11 17:16:29,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29" (1/1) ... [2024-10-11 17:16:29,408 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 384 [2024-10-11 17:16:29,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:16:29,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:16:29,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:16:29,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:16:29,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29" (1/1) ... [2024-10-11 17:16:29,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29" (1/1) ... [2024-10-11 17:16:29,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29" (1/1) ... [2024-10-11 17:16:29,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29" (1/1) ... [2024-10-11 17:16:29,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29" (1/1) ... [2024-10-11 17:16:29,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29" (1/1) ... [2024-10-11 17:16:29,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29" (1/1) ... [2024-10-11 17:16:29,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29" (1/1) ... [2024-10-11 17:16:29,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:16:29,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:16:29,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:16:29,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:16:29,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29" (1/1) ... [2024-10-11 17:16:29,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:16:29,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:16:29,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:16:29,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:16:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:16:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:16:29,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:16:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:16:29,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:16:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:16:29,571 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:16:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:16:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:16:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:16:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:16:29,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:16:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:16:29,574 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:16:29,724 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:16:29,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:16:30,362 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:16:30,362 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:16:30,398 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:16:30,398 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 17:16:30,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:30 BoogieIcfgContainer [2024-10-11 17:16:30,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:16:30,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:16:30,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:16:30,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:16:30,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:16:28" (1/3) ... [2024-10-11 17:16:30,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f9e2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:16:30, skipping insertion in model container [2024-10-11 17:16:30,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:29" (2/3) ... [2024-10-11 17:16:30,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f9e2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:16:30, skipping insertion in model container [2024-10-11 17:16:30,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:30" (3/3) ... [2024-10-11 17:16:30,408 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2024-10-11 17:16:30,424 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:16:30,425 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-10-11 17:16:30,425 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:16:30,649 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:16:30,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 499 places, 518 transitions, 1057 flow [2024-10-11 17:16:30,893 INFO L124 PetriNetUnfolderBase]: 29/515 cut-off events. [2024-10-11 17:16:30,894 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:16:30,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 515 events. 29/515 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 867 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 339. Up to 2 conditions per place. [2024-10-11 17:16:30,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 499 places, 518 transitions, 1057 flow [2024-10-11 17:16:30,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 455 places, 471 transitions, 960 flow [2024-10-11 17:16:30,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:16:30,952 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;@42f231cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:16:30,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-10-11 17:16:30,960 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:16:30,961 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-11 17:16:30,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:16:30,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:30,962 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] [2024-10-11 17:16:30,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:30,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash -97437285, now seen corresponding path program 1 times [2024-10-11 17:16:30,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:30,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244505169] [2024-10-11 17:16:30,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:30,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:31,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:31,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244505169] [2024-10-11 17:16:31,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244505169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:31,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:31,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698033510] [2024-10-11 17:16:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:31,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:31,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:31,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:31,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:31,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 518 [2024-10-11 17:16:31,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 471 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:31,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:31,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 518 [2024-10-11 17:16:31,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:31,626 INFO L124 PetriNetUnfolderBase]: 33/1039 cut-off events. [2024-10-11 17:16:31,627 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-11 17:16:31,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1039 events. 33/1039 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5177 event pairs, 15 based on Foata normal form. 37/937 useless extension candidates. Maximal degree in co-relation 824. Up to 55 conditions per place. [2024-10-11 17:16:31,644 INFO L140 encePairwiseOnDemand]: 495/518 looper letters, 15 selfloop transitions, 2 changer transitions 6/450 dead transitions. [2024-10-11 17:16:31,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 450 transitions, 952 flow [2024-10-11 17:16:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2024-10-11 17:16:31,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-10-11 17:16:31,671 INFO L175 Difference]: Start difference. First operand has 455 places, 471 transitions, 960 flow. Second operand 3 states and 1463 transitions. [2024-10-11 17:16:31,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 450 transitions, 952 flow [2024-10-11 17:16:31,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 940 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:16:31,688 INFO L231 Difference]: Finished difference. Result has 450 places, 444 transitions, 898 flow [2024-10-11 17:16:31,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=450, PETRI_TRANSITIONS=444} [2024-10-11 17:16:31,696 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-10-11 17:16:31,697 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 444 transitions, 898 flow [2024-10-11 17:16:31,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:31,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:31,699 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] [2024-10-11 17:16:31,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:16:31,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:31,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:31,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1490081496, now seen corresponding path program 1 times [2024-10-11 17:16:31,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:31,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557163150] [2024-10-11 17:16:31,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:31,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:31,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:31,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557163150] [2024-10-11 17:16:31,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557163150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:31,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:31,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:31,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624711605] [2024-10-11 17:16:31,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:31,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:31,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:31,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:31,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:31,811 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 469 out of 518 [2024-10-11 17:16:31,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 444 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:31,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:31,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 469 of 518 [2024-10-11 17:16:31,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:32,235 INFO L124 PetriNetUnfolderBase]: 100/2658 cut-off events. [2024-10-11 17:16:32,236 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-11 17:16:32,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 2658 events. 100/2658 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 19686 event pairs, 56 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 2797. Up to 152 conditions per place. [2024-10-11 17:16:32,259 INFO L140 encePairwiseOnDemand]: 511/518 looper letters, 18 selfloop transitions, 1 changer transitions 0/438 dead transitions. [2024-10-11 17:16:32,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 438 transitions, 924 flow [2024-10-11 17:16:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1432 transitions. [2024-10-11 17:16:32,265 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9214929214929215 [2024-10-11 17:16:32,265 INFO L175 Difference]: Start difference. First operand has 450 places, 444 transitions, 898 flow. Second operand 3 states and 1432 transitions. [2024-10-11 17:16:32,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 438 transitions, 924 flow [2024-10-11 17:16:32,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 438 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:32,272 INFO L231 Difference]: Finished difference. Result has 438 places, 438 transitions, 884 flow [2024-10-11 17:16:32,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=438, PETRI_TRANSITIONS=438} [2024-10-11 17:16:32,274 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-10-11 17:16:32,274 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 438 transitions, 884 flow [2024-10-11 17:16:32,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:32,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:32,276 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] [2024-10-11 17:16:32,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:16:32,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:32,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash -750720517, now seen corresponding path program 1 times [2024-10-11 17:16:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:32,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253175744] [2024-10-11 17:16:32,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:32,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:32,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253175744] [2024-10-11 17:16:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253175744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:32,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:32,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179941758] [2024-10-11 17:16:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:32,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:32,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:32,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:32,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:33,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 518 [2024-10-11 17:16:33,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 438 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:33,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:33,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 518 [2024-10-11 17:16:33,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:34,561 INFO L124 PetriNetUnfolderBase]: 1199/6233 cut-off events. [2024-10-11 17:16:34,562 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2024-10-11 17:16:34,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8054 conditions, 6233 events. 1199/6233 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 54396 event pairs, 864 based on Foata normal form. 0/5379 useless extension candidates. Maximal degree in co-relation 8023. Up to 1772 conditions per place. [2024-10-11 17:16:34,620 INFO L140 encePairwiseOnDemand]: 500/518 looper letters, 54 selfloop transitions, 15 changer transitions 0/435 dead transitions. [2024-10-11 17:16:34,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1016 flow [2024-10-11 17:16:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:16:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:16:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2604 transitions. [2024-10-11 17:16:34,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8378378378378378 [2024-10-11 17:16:34,627 INFO L175 Difference]: Start difference. First operand has 438 places, 438 transitions, 884 flow. Second operand 6 states and 2604 transitions. [2024-10-11 17:16:34,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1016 flow [2024-10-11 17:16:34,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:34,635 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 907 flow [2024-10-11 17:16:34,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=907, PETRI_PLACES=439, PETRI_TRANSITIONS=435} [2024-10-11 17:16:34,637 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2024-10-11 17:16:34,638 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 907 flow [2024-10-11 17:16:34,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:34,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:34,640 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] [2024-10-11 17:16:34,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:16:34,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:34,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:34,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1977528840, now seen corresponding path program 1 times [2024-10-11 17:16:34,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:34,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104396381] [2024-10-11 17:16:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:34,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:34,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104396381] [2024-10-11 17:16:34,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104396381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:34,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:34,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:34,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366646991] [2024-10-11 17:16:34,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:34,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:34,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:34,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:34,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-10-11 17:16:34,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 435 transitions, 907 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:34,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:34,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-10-11 17:16:34,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:34,869 INFO L124 PetriNetUnfolderBase]: 13/623 cut-off events. [2024-10-11 17:16:34,869 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:16:34,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 623 events. 13/623 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1674 event pairs, 5 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 638. Up to 22 conditions per place. [2024-10-11 17:16:34,875 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2024-10-11 17:16:34,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 434 transitions, 931 flow [2024-10-11 17:16:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-10-11 17:16:34,881 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-10-11 17:16:34,881 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 907 flow. Second operand 3 states and 1451 transitions. [2024-10-11 17:16:34,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 434 transitions, 931 flow [2024-10-11 17:16:34,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 434 transitions, 901 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:16:34,889 INFO L231 Difference]: Finished difference. Result has 435 places, 434 transitions, 879 flow [2024-10-11 17:16:34,890 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=879, PETRI_PLACES=435, PETRI_TRANSITIONS=434} [2024-10-11 17:16:34,891 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -20 predicate places. [2024-10-11 17:16:34,891 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 434 transitions, 879 flow [2024-10-11 17:16:34,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:34,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:34,892 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] [2024-10-11 17:16:34,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:16:34,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:34,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:34,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1497042718, now seen corresponding path program 1 times [2024-10-11 17:16:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:34,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782358201] [2024-10-11 17:16:34,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:34,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:34,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782358201] [2024-10-11 17:16:34,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782358201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:34,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:34,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:34,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779578521] [2024-10-11 17:16:34,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:34,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:34,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:34,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:34,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:34,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-10-11 17:16:34,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 434 transitions, 879 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:34,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:34,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-10-11 17:16:34,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:35,046 INFO L124 PetriNetUnfolderBase]: 14/563 cut-off events. [2024-10-11 17:16:35,047 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:16:35,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 563 events. 14/563 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1312 event pairs, 7 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 567. Up to 25 conditions per place. [2024-10-11 17:16:35,053 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2024-10-11 17:16:35,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 903 flow [2024-10-11 17:16:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-10-11 17:16:35,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-10-11 17:16:35,057 INFO L175 Difference]: Start difference. First operand has 435 places, 434 transitions, 879 flow. Second operand 3 states and 1451 transitions. [2024-10-11 17:16:35,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 903 flow [2024-10-11 17:16:35,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 433 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:35,065 INFO L231 Difference]: Finished difference. Result has 434 places, 433 transitions, 877 flow [2024-10-11 17:16:35,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=434, PETRI_TRANSITIONS=433} [2024-10-11 17:16:35,066 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2024-10-11 17:16:35,067 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 433 transitions, 877 flow [2024-10-11 17:16:35,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:35,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:35,068 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] [2024-10-11 17:16:35,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:16:35,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:35,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash -843219424, now seen corresponding path program 1 times [2024-10-11 17:16:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:35,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770443788] [2024-10-11 17:16:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:35,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:35,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:35,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770443788] [2024-10-11 17:16:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770443788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:35,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:35,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:35,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671478164] [2024-10-11 17:16:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:35,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:35,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:35,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:35,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:35,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-10-11 17:16:35,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 433 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:35,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:35,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-10-11 17:16:35,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:35,277 INFO L124 PetriNetUnfolderBase]: 10/440 cut-off events. [2024-10-11 17:16:35,277 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:16:35,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 440 events. 10/440 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 798 event pairs, 4 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 438. Up to 20 conditions per place. [2024-10-11 17:16:35,283 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2024-10-11 17:16:35,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 432 transitions, 901 flow [2024-10-11 17:16:35,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-10-11 17:16:35,287 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-10-11 17:16:35,287 INFO L175 Difference]: Start difference. First operand has 434 places, 433 transitions, 877 flow. Second operand 3 states and 1451 transitions. [2024-10-11 17:16:35,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 432 transitions, 901 flow [2024-10-11 17:16:35,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 432 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:35,296 INFO L231 Difference]: Finished difference. Result has 433 places, 432 transitions, 875 flow [2024-10-11 17:16:35,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=433, PETRI_TRANSITIONS=432} [2024-10-11 17:16:35,299 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -22 predicate places. [2024-10-11 17:16:35,300 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 432 transitions, 875 flow [2024-10-11 17:16:35,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:35,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:35,302 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] [2024-10-11 17:16:35,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:16:35,302 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:35,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1888702319, now seen corresponding path program 1 times [2024-10-11 17:16:35,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:35,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93485451] [2024-10-11 17:16:35,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:35,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:35,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:35,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93485451] [2024-10-11 17:16:35,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93485451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:35,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:35,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:35,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514008724] [2024-10-11 17:16:35,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:35,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:35,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:35,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:35,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-11 17:16:35,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 432 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:35,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:35,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-11 17:16:35,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:35,503 INFO L124 PetriNetUnfolderBase]: 15/547 cut-off events. [2024-10-11 17:16:35,503 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:16:35,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 547 events. 15/547 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1392 event pairs, 2 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 557. Up to 14 conditions per place. [2024-10-11 17:16:35,511 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 10 selfloop transitions, 3 changer transitions 0/432 dead transitions. [2024-10-11 17:16:35,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 432 transitions, 903 flow [2024-10-11 17:16:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1458 transitions. [2024-10-11 17:16:35,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9382239382239382 [2024-10-11 17:16:35,516 INFO L175 Difference]: Start difference. First operand has 433 places, 432 transitions, 875 flow. Second operand 3 states and 1458 transitions. [2024-10-11 17:16:35,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 432 transitions, 903 flow [2024-10-11 17:16:35,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 432 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:35,525 INFO L231 Difference]: Finished difference. Result has 431 places, 430 transitions, 873 flow [2024-10-11 17:16:35,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=873, PETRI_PLACES=431, PETRI_TRANSITIONS=430} [2024-10-11 17:16:35,527 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -24 predicate places. [2024-10-11 17:16:35,527 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 430 transitions, 873 flow [2024-10-11 17:16:35,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:35,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:35,528 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] [2024-10-11 17:16:35,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:16:35,530 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:35,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:35,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1728199023, now seen corresponding path program 1 times [2024-10-11 17:16:35,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:35,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697965887] [2024-10-11 17:16:35,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:35,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:35,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:35,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697965887] [2024-10-11 17:16:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697965887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:35,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:35,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:35,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539561232] [2024-10-11 17:16:35,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:35,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:35,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:35,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:35,612 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-11 17:16:35,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 430 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:35,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:35,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-11 17:16:35,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:35,832 INFO L124 PetriNetUnfolderBase]: 31/1093 cut-off events. [2024-10-11 17:16:35,832 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 17:16:35,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 1093 events. 31/1093 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4659 event pairs, 2 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1137. Up to 46 conditions per place. [2024-10-11 17:16:35,845 INFO L140 encePairwiseOnDemand]: 514/518 looper letters, 16 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2024-10-11 17:16:35,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 435 transitions, 924 flow [2024-10-11 17:16:35,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2024-10-11 17:16:35,850 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-10-11 17:16:35,850 INFO L175 Difference]: Start difference. First operand has 431 places, 430 transitions, 873 flow. Second operand 3 states and 1463 transitions. [2024-10-11 17:16:35,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 435 transitions, 924 flow [2024-10-11 17:16:35,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 435 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:35,861 INFO L231 Difference]: Finished difference. Result has 430 places, 430 transitions, 877 flow [2024-10-11 17:16:35,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=430, PETRI_TRANSITIONS=430} [2024-10-11 17:16:35,864 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2024-10-11 17:16:35,865 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 430 transitions, 877 flow [2024-10-11 17:16:35,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:35,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:35,866 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-10-11 17:16:35,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:16:35,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:35,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1961587418, now seen corresponding path program 1 times [2024-10-11 17:16:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:35,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136557415] [2024-10-11 17:16:35,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:35,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:35,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136557415] [2024-10-11 17:16:35,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136557415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:35,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:35,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:35,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046525308] [2024-10-11 17:16:35,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:35,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:35,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:35,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:35,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:35,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-11 17:16:35,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 430 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:35,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:35,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-11 17:16:35,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:36,078 INFO L124 PetriNetUnfolderBase]: 25/750 cut-off events. [2024-10-11 17:16:36,078 INFO L125 PetriNetUnfolderBase]: For 12/33 co-relation queries the response was YES. [2024-10-11 17:16:36,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 750 events. 25/750 cut-off events. For 12/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2538 event pairs, 3 based on Foata normal form. 4/686 useless extension candidates. Maximal degree in co-relation 778. Up to 21 conditions per place. [2024-10-11 17:16:36,090 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 9 selfloop transitions, 2 changer transitions 4/430 dead transitions. [2024-10-11 17:16:36,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 430 transitions, 903 flow [2024-10-11 17:16:36,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2024-10-11 17:16:36,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375804375804376 [2024-10-11 17:16:36,093 INFO L175 Difference]: Start difference. First operand has 430 places, 430 transitions, 877 flow. Second operand 3 states and 1457 transitions. [2024-10-11 17:16:36,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 430 transitions, 903 flow [2024-10-11 17:16:36,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 430 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:16:36,100 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 869 flow [2024-10-11 17:16:36,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2024-10-11 17:16:36,101 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2024-10-11 17:16:36,101 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 869 flow [2024-10-11 17:16:36,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:36,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:36,103 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] [2024-10-11 17:16:36,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:16:36,103 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:36,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:36,104 INFO L85 PathProgramCache]: Analyzing trace with hash 405174824, now seen corresponding path program 1 times [2024-10-11 17:16:36,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:36,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071306908] [2024-10-11 17:16:36,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:36,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:36,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:36,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071306908] [2024-10-11 17:16:36,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071306908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:36,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:36,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:36,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324486257] [2024-10-11 17:16:36,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:36,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:36,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:36,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:36,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:36,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-11 17:16:36,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 869 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:36,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:36,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-11 17:16:36,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:36,436 INFO L124 PetriNetUnfolderBase]: 73/1869 cut-off events. [2024-10-11 17:16:36,437 INFO L125 PetriNetUnfolderBase]: For 25/29 co-relation queries the response was YES. [2024-10-11 17:16:36,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 1869 events. 73/1869 cut-off events. For 25/29 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 11396 event pairs, 6 based on Foata normal form. 0/1674 useless extension candidates. Maximal degree in co-relation 1989. Up to 93 conditions per place. [2024-10-11 17:16:36,457 INFO L140 encePairwiseOnDemand]: 514/518 looper letters, 15 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2024-10-11 17:16:36,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 428 transitions, 915 flow [2024-10-11 17:16:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1462 transitions. [2024-10-11 17:16:36,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9407979407979408 [2024-10-11 17:16:36,461 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 869 flow. Second operand 3 states and 1462 transitions. [2024-10-11 17:16:36,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 428 transitions, 915 flow [2024-10-11 17:16:36,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 428 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:36,470 INFO L231 Difference]: Finished difference. Result has 425 places, 424 transitions, 875 flow [2024-10-11 17:16:36,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=425, PETRI_TRANSITIONS=424} [2024-10-11 17:16:36,471 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -30 predicate places. [2024-10-11 17:16:36,471 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 424 transitions, 875 flow [2024-10-11 17:16:36,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:36,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:36,473 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] [2024-10-11 17:16:36,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:16:36,473 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:36,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:36,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2061289579, now seen corresponding path program 1 times [2024-10-11 17:16:36,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:36,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428272096] [2024-10-11 17:16:36,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:36,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:36,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:36,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428272096] [2024-10-11 17:16:36,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428272096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:36,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:36,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:16:36,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487615139] [2024-10-11 17:16:36,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:36,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:16:36,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:36,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:16:36,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:16:36,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-10-11 17:16:36,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 424 transitions, 875 flow. Second operand has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:36,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:36,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-10-11 17:16:36,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:37,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1415] thread3EXIT-->L88: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][413], [537#true, Black: 526#true, 83#L88true, 507#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 528#(= |#race~A~0| 0), Black: 533#true]) [2024-10-11 17:16:37,361 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is cut-off event [2024-10-11 17:16:37,362 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-11 17:16:37,362 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-11 17:16:37,362 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-11 17:16:37,363 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1415] thread3EXIT-->L88: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][413], [537#true, Black: 526#true, 83#L88true, 507#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), Black: 533#true, 528#(= |#race~A~0| 0)]) [2024-10-11 17:16:37,363 INFO L294 olderBase$Statistics]: this new event has 308 ancestors and is not cut-off event [2024-10-11 17:16:37,363 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is not cut-off event [2024-10-11 17:16:37,363 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-10-11 17:16:37,363 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is not cut-off event [2024-10-11 17:16:37,364 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-10-11 17:16:37,382 INFO L124 PetriNetUnfolderBase]: 60/2025 cut-off events. [2024-10-11 17:16:37,382 INFO L125 PetriNetUnfolderBase]: For 13/62 co-relation queries the response was YES. [2024-10-11 17:16:37,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 2025 events. 60/2025 cut-off events. For 13/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10776 event pairs, 14 based on Foata normal form. 4/1859 useless extension candidates. Maximal degree in co-relation 2234. Up to 68 conditions per place. [2024-10-11 17:16:37,404 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/467 dead transitions. [2024-10-11 17:16:37,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 467 transitions, 1133 flow [2024-10-11 17:16:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:16:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 17:16:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-10-11 17:16:37,412 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-10-11 17:16:37,413 INFO L175 Difference]: Start difference. First operand has 425 places, 424 transitions, 875 flow. Second operand 10 states and 4633 transitions. [2024-10-11 17:16:37,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 467 transitions, 1133 flow [2024-10-11 17:16:37,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 467 transitions, 1133 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:16:37,420 INFO L231 Difference]: Finished difference. Result has 438 places, 449 transitions, 1067 flow [2024-10-11 17:16:37,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1067, PETRI_PLACES=438, PETRI_TRANSITIONS=449} [2024-10-11 17:16:37,421 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-10-11 17:16:37,422 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 449 transitions, 1067 flow [2024-10-11 17:16:37,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:37,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:37,424 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-10-11 17:16:37,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:16:37,424 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:37,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:37,425 INFO L85 PathProgramCache]: Analyzing trace with hash -472792529, now seen corresponding path program 1 times [2024-10-11 17:16:37,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:37,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151908309] [2024-10-11 17:16:37,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:37,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:37,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:37,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151908309] [2024-10-11 17:16:37,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151908309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:37,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:37,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:37,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558250736] [2024-10-11 17:16:37,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:37,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:37,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:37,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:37,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-11 17:16:37,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 449 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:37,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:37,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-11 17:16:37,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:37,812 INFO L124 PetriNetUnfolderBase]: 102/2072 cut-off events. [2024-10-11 17:16:37,812 INFO L125 PetriNetUnfolderBase]: For 80/90 co-relation queries the response was YES. [2024-10-11 17:16:37,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 2072 events. 102/2072 cut-off events. For 80/90 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11374 event pairs, 2 based on Foata normal form. 0/1906 useless extension candidates. Maximal degree in co-relation 2365. Up to 124 conditions per place. [2024-10-11 17:16:37,834 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 14 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2024-10-11 17:16:37,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 451 transitions, 1104 flow [2024-10-11 17:16:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2024-10-11 17:16:37,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9395109395109396 [2024-10-11 17:16:37,837 INFO L175 Difference]: Start difference. First operand has 438 places, 449 transitions, 1067 flow. Second operand 3 states and 1460 transitions. [2024-10-11 17:16:37,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 451 transitions, 1104 flow [2024-10-11 17:16:37,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 451 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:16:37,891 INFO L231 Difference]: Finished difference. Result has 439 places, 448 transitions, 1070 flow [2024-10-11 17:16:37,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=439, PETRI_TRANSITIONS=448} [2024-10-11 17:16:37,892 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2024-10-11 17:16:37,893 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 448 transitions, 1070 flow [2024-10-11 17:16:37,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:37,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:37,894 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] [2024-10-11 17:16:37,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:16:37,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:37,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:37,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1592361780, now seen corresponding path program 1 times [2024-10-11 17:16:37,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:37,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661213654] [2024-10-11 17:16:37,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:37,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:38,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661213654] [2024-10-11 17:16:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661213654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:38,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:38,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:16:38,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472206464] [2024-10-11 17:16:38,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:38,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:16:38,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:38,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:16:38,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:16:38,343 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-10-11 17:16:38,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 448 transitions, 1070 flow. Second operand has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:38,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:38,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-10-11 17:16:38,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:38,690 INFO L124 PetriNetUnfolderBase]: 73/1499 cut-off events. [2024-10-11 17:16:38,690 INFO L125 PetriNetUnfolderBase]: For 103/173 co-relation queries the response was YES. [2024-10-11 17:16:38,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1499 events. 73/1499 cut-off events. For 103/173 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7142 event pairs, 28 based on Foata normal form. 4/1396 useless extension candidates. Maximal degree in co-relation 1803. Up to 99 conditions per place. [2024-10-11 17:16:38,708 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/468 dead transitions. [2024-10-11 17:16:38,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 468 transitions, 1302 flow [2024-10-11 17:16:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:16:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 17:16:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-10-11 17:16:38,717 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-10-11 17:16:38,717 INFO L175 Difference]: Start difference. First operand has 439 places, 448 transitions, 1070 flow. Second operand 10 states and 4633 transitions. [2024-10-11 17:16:38,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 468 transitions, 1302 flow [2024-10-11 17:16:38,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 468 transitions, 1302 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:16:38,729 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 1175 flow [2024-10-11 17:16:38,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1175, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2024-10-11 17:16:38,731 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-10-11 17:16:38,731 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 1175 flow [2024-10-11 17:16:38,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:38,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:38,733 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] [2024-10-11 17:16:38,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:16:38,734 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:38,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:38,734 INFO L85 PathProgramCache]: Analyzing trace with hash 357189461, now seen corresponding path program 1 times [2024-10-11 17:16:38,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:38,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834766932] [2024-10-11 17:16:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:38,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:38,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:38,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834766932] [2024-10-11 17:16:38,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834766932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:38,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:38,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:16:38,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146335743] [2024-10-11 17:16:38,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:38,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:16:38,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:38,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:16:38,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:16:39,280 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-10-11 17:16:39,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 1175 flow. Second operand has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:39,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:39,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-10-11 17:16:39,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:39,717 INFO L124 PetriNetUnfolderBase]: 72/1494 cut-off events. [2024-10-11 17:16:39,718 INFO L125 PetriNetUnfolderBase]: For 169/176 co-relation queries the response was YES. [2024-10-11 17:16:39,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1494 events. 72/1494 cut-off events. For 169/176 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6960 event pairs, 29 based on Foata normal form. 3/1401 useless extension candidates. Maximal degree in co-relation 1837. Up to 98 conditions per place. [2024-10-11 17:16:39,735 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/470 dead transitions. [2024-10-11 17:16:39,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 470 transitions, 1407 flow [2024-10-11 17:16:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:16:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 17:16:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-10-11 17:16:39,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-10-11 17:16:39,747 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 1175 flow. Second operand 10 states and 4633 transitions. [2024-10-11 17:16:39,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 470 transitions, 1407 flow [2024-10-11 17:16:39,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 470 transitions, 1334 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-11 17:16:39,757 INFO L231 Difference]: Finished difference. Result has 454 places, 452 transitions, 1207 flow [2024-10-11 17:16:39,758 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1207, PETRI_PLACES=454, PETRI_TRANSITIONS=452} [2024-10-11 17:16:39,758 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -1 predicate places. [2024-10-11 17:16:39,759 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 452 transitions, 1207 flow [2024-10-11 17:16:39,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:39,760 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:39,761 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] [2024-10-11 17:16:39,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:16:39,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:39,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:39,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1454371584, now seen corresponding path program 1 times [2024-10-11 17:16:39,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:39,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875940755] [2024-10-11 17:16:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:39,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:39,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:39,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875940755] [2024-10-11 17:16:39,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875940755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:39,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:39,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:39,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437144074] [2024-10-11 17:16:39,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:39,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:39,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:39,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:39,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:39,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-11 17:16:39,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 452 transitions, 1207 flow. Second operand has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:39,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:39,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-11 17:16:39,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:40,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1357] L68-->L68-1: Formula: (= |v_#race~csum~0_4| 0) InVars {} OutVars{#race~csum~0=|v_#race~csum~0_4|} AuxVars[] AssignedVars[#race~csum~0][403], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), 302#L68-1true, 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 602#(= |#race~csum~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), 282#L87true, 528#(= |#race~A~0| 0), Black: 533#true, 581#true, 562#true]) [2024-10-11 17:16:40,069 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-10-11 17:16:40,069 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-10-11 17:16:40,069 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-10-11 17:16:40,069 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2024-10-11 17:16:40,083 INFO L124 PetriNetUnfolderBase]: 48/1185 cut-off events. [2024-10-11 17:16:40,083 INFO L125 PetriNetUnfolderBase]: For 94/98 co-relation queries the response was YES. [2024-10-11 17:16:40,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1185 events. 48/1185 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4399 event pairs, 3 based on Foata normal form. 6/1127 useless extension candidates. Maximal degree in co-relation 1423. Up to 37 conditions per place. [2024-10-11 17:16:40,095 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 8 selfloop transitions, 2 changer transitions 28/452 dead transitions. [2024-10-11 17:16:40,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 1233 flow [2024-10-11 17:16:40,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2024-10-11 17:16:40,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375804375804376 [2024-10-11 17:16:40,098 INFO L175 Difference]: Start difference. First operand has 454 places, 452 transitions, 1207 flow. Second operand 3 states and 1457 transitions. [2024-10-11 17:16:40,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 1233 flow [2024-10-11 17:16:40,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 452 transitions, 1160 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-11 17:16:40,106 INFO L231 Difference]: Finished difference. Result has 447 places, 422 transitions, 975 flow [2024-10-11 17:16:40,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=447, PETRI_TRANSITIONS=422} [2024-10-11 17:16:40,108 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2024-10-11 17:16:40,108 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 422 transitions, 975 flow [2024-10-11 17:16:40,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:40,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:40,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:40,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:16:40,110 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:40,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:40,110 INFO L85 PathProgramCache]: Analyzing trace with hash -728454956, now seen corresponding path program 1 times [2024-10-11 17:16:40,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:40,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173938300] [2024-10-11 17:16:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:40,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:16:40,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:40,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173938300] [2024-10-11 17:16:40,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173938300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:40,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:40,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:40,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920848402] [2024-10-11 17:16:40,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:40,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:40,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:40,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:40,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:41,041 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-10-11 17:16:41,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 422 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:41,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:41,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-10-11 17:16:41,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:41,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 600#true, Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, 603#true, Black: 586#(<= ~N~0 0), 282#L87true, 507#(= |#race~N~0| 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 39#L67-27true, 528#(= |#race~A~0| 0), Black: 533#true, 562#true]) [2024-10-11 17:16:41,575 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2024-10-11 17:16:41,576 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-11 17:16:41,576 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-11 17:16:41,576 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-11 17:16:41,829 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 600#true, Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, 603#true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 282#L87true, 507#(= |#race~N~0| 0), 39#L67-27true, Black: 533#true, 528#(= |#race~A~0| 0), 562#true]) [2024-10-11 17:16:41,830 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-10-11 17:16:41,830 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2024-10-11 17:16:41,830 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-11 17:16:41,830 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-11 17:16:41,830 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-11 17:16:41,847 INFO L124 PetriNetUnfolderBase]: 203/3554 cut-off events. [2024-10-11 17:16:41,847 INFO L125 PetriNetUnfolderBase]: For 56/77 co-relation queries the response was YES. [2024-10-11 17:16:41,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 3554 events. 203/3554 cut-off events. For 56/77 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 25936 event pairs, 44 based on Foata normal form. 4/3276 useless extension candidates. Maximal degree in co-relation 4196. Up to 292 conditions per place. [2024-10-11 17:16:41,899 INFO L140 encePairwiseOnDemand]: 507/518 looper letters, 39 selfloop transitions, 22 changer transitions 0/451 dead transitions. [2024-10-11 17:16:41,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 451 transitions, 1163 flow [2024-10-11 17:16:41,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:16:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:16:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2024-10-11 17:16:41,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-10-11 17:16:41,906 INFO L175 Difference]: Start difference. First operand has 447 places, 422 transitions, 975 flow. Second operand 6 states and 2828 transitions. [2024-10-11 17:16:41,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 451 transitions, 1163 flow [2024-10-11 17:16:41,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 451 transitions, 1087 flow, removed 14 selfloop flow, removed 15 redundant places. [2024-10-11 17:16:41,916 INFO L231 Difference]: Finished difference. Result has 434 places, 443 transitions, 1049 flow [2024-10-11 17:16:41,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=434, PETRI_TRANSITIONS=443} [2024-10-11 17:16:41,917 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2024-10-11 17:16:41,918 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 443 transitions, 1049 flow [2024-10-11 17:16:41,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:41,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:41,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:41,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:16:41,926 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:41,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:41,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2090320587, now seen corresponding path program 1 times [2024-10-11 17:16:41,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:41,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376114926] [2024-10-11 17:16:41,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:41,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:16:42,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:42,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376114926] [2024-10-11 17:16:42,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376114926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:42,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:42,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920497617] [2024-10-11 17:16:42,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:42,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:42,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:42,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:42,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-10-11 17:16:42,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 443 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:42,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:42,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-10-11 17:16:42,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:44,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L59-2-->L59-3: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][286], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 560#(= |#race~C~0| 0), 308#L86-1true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 558#true, Black: 526#true, 603#true, 85#L67-11true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 202#L59-3true]) [2024-10-11 17:16:44,464 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-10-11 17:16:44,464 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-11 17:16:44,464 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-10-11 17:16:44,464 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-11 17:16:45,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, 308#L86-1true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 145#L62true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 526#true, Black: 558#true, 603#true, 507#(= |#race~N~0| 0), 39#L67-27true, Black: 533#true, 528#(= |#race~A~0| 0)]) [2024-10-11 17:16:45,109 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2024-10-11 17:16:45,109 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-10-11 17:16:45,109 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-10-11 17:16:45,109 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-10-11 17:16:45,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 558#true, Black: 526#true, 603#true, 507#(= |#race~N~0| 0), 282#L87true, 39#L67-27true, 528#(= |#race~A~0| 0), Black: 533#true]) [2024-10-11 17:16:45,151 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-10-11 17:16:45,151 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-11 17:16:45,151 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-11 17:16:45,151 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-11 17:16:45,299 INFO L124 PetriNetUnfolderBase]: 1328/14868 cut-off events. [2024-10-11 17:16:45,299 INFO L125 PetriNetUnfolderBase]: For 1656/1738 co-relation queries the response was YES. [2024-10-11 17:16:45,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18895 conditions, 14868 events. 1328/14868 cut-off events. For 1656/1738 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 171997 event pairs, 205 based on Foata normal form. 0/13463 useless extension candidates. Maximal degree in co-relation 18855. Up to 1392 conditions per place. [2024-10-11 17:16:45,479 INFO L140 encePairwiseOnDemand]: 507/518 looper letters, 55 selfloop transitions, 86 changer transitions 0/536 dead transitions. [2024-10-11 17:16:45,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 536 transitions, 1813 flow [2024-10-11 17:16:45,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:16:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:16:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2024-10-11 17:16:45,486 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-10-11 17:16:45,486 INFO L175 Difference]: Start difference. First operand has 434 places, 443 transitions, 1049 flow. Second operand 6 states and 2828 transitions. [2024-10-11 17:16:45,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 536 transitions, 1813 flow [2024-10-11 17:16:45,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 536 transitions, 1813 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:16:45,502 INFO L231 Difference]: Finished difference. Result has 444 places, 528 transitions, 1903 flow [2024-10-11 17:16:45,502 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1903, PETRI_PLACES=444, PETRI_TRANSITIONS=528} [2024-10-11 17:16:45,503 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -11 predicate places. [2024-10-11 17:16:45,503 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 528 transitions, 1903 flow [2024-10-11 17:16:45,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:45,505 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:45,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:45,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:16:45,506 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:45,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:45,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1264112148, now seen corresponding path program 1 times [2024-10-11 17:16:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:45,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174533663] [2024-10-11 17:16:45,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:45,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:16:46,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:46,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174533663] [2024-10-11 17:16:46,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174533663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:46,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:46,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:46,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709548284] [2024-10-11 17:16:46,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:46,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:46,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:46,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:46,400 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-10-11 17:16:46,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 528 transitions, 1903 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:46,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:46,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-10-11 17:16:46,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:48,498 INFO L124 PetriNetUnfolderBase]: 1151/12311 cut-off events. [2024-10-11 17:16:48,498 INFO L125 PetriNetUnfolderBase]: For 3742/3852 co-relation queries the response was YES. [2024-10-11 17:16:48,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 12311 events. 1151/12311 cut-off events. For 3742/3852 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 136360 event pairs, 132 based on Foata normal form. 0/11312 useless extension candidates. Maximal degree in co-relation 17418. Up to 1063 conditions per place. [2024-10-11 17:16:48,583 INFO L140 encePairwiseOnDemand]: 512/518 looper letters, 106 selfloop transitions, 29 changer transitions 0/535 dead transitions. [2024-10-11 17:16:48,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 535 transitions, 2195 flow [2024-10-11 17:16:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:16:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:16:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2024-10-11 17:16:48,588 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9028314028314028 [2024-10-11 17:16:48,589 INFO L175 Difference]: Start difference. First operand has 444 places, 528 transitions, 1903 flow. Second operand 6 states and 2806 transitions. [2024-10-11 17:16:48,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 535 transitions, 2195 flow [2024-10-11 17:16:48,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 535 transitions, 2195 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:16:48,603 INFO L231 Difference]: Finished difference. Result has 448 places, 527 transitions, 1959 flow [2024-10-11 17:16:48,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1959, PETRI_PLACES=448, PETRI_TRANSITIONS=527} [2024-10-11 17:16:48,604 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -7 predicate places. [2024-10-11 17:16:48,604 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 527 transitions, 1959 flow [2024-10-11 17:16:48,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:48,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:48,605 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, 1, 1, 1, 1, 1, 1, 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-10-11 17:16:48,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:16:48,606 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:48,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:48,606 INFO L85 PathProgramCache]: Analyzing trace with hash -621426886, now seen corresponding path program 1 times [2024-10-11 17:16:48,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:48,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017705785] [2024-10-11 17:16:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:48,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:16:49,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:49,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017705785] [2024-10-11 17:16:49,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017705785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:49,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:49,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:49,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133509120] [2024-10-11 17:16:49,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:49,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:49,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:49,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:49,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:49,554 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-10-11 17:16:49,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 527 transitions, 1959 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:49,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:49,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-10-11 17:16:49,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:51,679 INFO L124 PetriNetUnfolderBase]: 1146/12228 cut-off events. [2024-10-11 17:16:51,680 INFO L125 PetriNetUnfolderBase]: For 4433/4543 co-relation queries the response was YES. [2024-10-11 17:16:51,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17858 conditions, 12228 events. 1146/12228 cut-off events. For 4433/4543 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 135088 event pairs, 132 based on Foata normal form. 0/11296 useless extension candidates. Maximal degree in co-relation 17812. Up to 1063 conditions per place. [2024-10-11 17:16:51,770 INFO L140 encePairwiseOnDemand]: 512/518 looper letters, 106 selfloop transitions, 29 changer transitions 0/534 dead transitions. [2024-10-11 17:16:51,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 534 transitions, 2251 flow [2024-10-11 17:16:51,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:16:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:16:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2024-10-11 17:16:51,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9028314028314028 [2024-10-11 17:16:51,779 INFO L175 Difference]: Start difference. First operand has 448 places, 527 transitions, 1959 flow. Second operand 6 states and 2806 transitions. [2024-10-11 17:16:51,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 534 transitions, 2251 flow [2024-10-11 17:16:51,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 534 transitions, 2193 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:16:51,800 INFO L231 Difference]: Finished difference. Result has 447 places, 526 transitions, 1957 flow [2024-10-11 17:16:51,801 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1957, PETRI_PLACES=447, PETRI_TRANSITIONS=526} [2024-10-11 17:16:51,801 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2024-10-11 17:16:51,801 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 526 transitions, 1957 flow [2024-10-11 17:16:51,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:51,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:51,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:16:51,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:16:51,803 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:51,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash -237480508, now seen corresponding path program 1 times [2024-10-11 17:16:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:51,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030517221] [2024-10-11 17:16:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:16:51,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:51,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030517221] [2024-10-11 17:16:51,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030517221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:51,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:51,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:51,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298261726] [2024-10-11 17:16:51,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:51,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:51,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:51,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:51,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:51,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-11 17:16:51,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 526 transitions, 1957 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:51,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:51,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-11 17:16:51,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:53,799 INFO L124 PetriNetUnfolderBase]: 884/10875 cut-off events. [2024-10-11 17:16:53,799 INFO L125 PetriNetUnfolderBase]: For 2300/2408 co-relation queries the response was YES. [2024-10-11 17:16:53,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14887 conditions, 10875 events. 884/10875 cut-off events. For 2300/2408 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 115890 event pairs, 71 based on Foata normal form. 1/10088 useless extension candidates. Maximal degree in co-relation 14842. Up to 727 conditions per place. [2024-10-11 17:16:53,874 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 10 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2024-10-11 17:16:53,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 527 transitions, 1985 flow [2024-10-11 17:16:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2024-10-11 17:16:53,878 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-10-11 17:16:53,878 INFO L175 Difference]: Start difference. First operand has 447 places, 526 transitions, 1957 flow. Second operand 3 states and 1456 transitions. [2024-10-11 17:16:53,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 527 transitions, 1985 flow [2024-10-11 17:16:53,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 527 transitions, 1927 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:16:53,898 INFO L231 Difference]: Finished difference. Result has 443 places, 525 transitions, 1901 flow [2024-10-11 17:16:53,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=443, PETRI_TRANSITIONS=525} [2024-10-11 17:16:53,899 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -12 predicate places. [2024-10-11 17:16:53,899 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 525 transitions, 1901 flow [2024-10-11 17:16:53,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:53,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:53,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:16:53,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:16:53,900 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:53,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1878527003, now seen corresponding path program 1 times [2024-10-11 17:16:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:53,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920970950] [2024-10-11 17:16:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:53,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:16:53,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:53,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920970950] [2024-10-11 17:16:53,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920970950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:53,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:53,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:53,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134669957] [2024-10-11 17:16:53,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:53,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:53,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:53,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:54,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-11 17:16:54,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 525 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:54,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:54,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-11 17:16:54,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:55,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L59-2-->L59-3: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][278], [560#(= |#race~C~0| 0), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 308#L86-1true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 640#true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 526#true, Black: 558#true, 637#true, 603#true, 85#L67-11true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 202#L59-3true]) [2024-10-11 17:16:55,865 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-10-11 17:16:55,865 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-11 17:16:55,865 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-10-11 17:16:55,865 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-11 17:16:56,022 INFO L124 PetriNetUnfolderBase]: 997/11923 cut-off events. [2024-10-11 17:16:56,022 INFO L125 PetriNetUnfolderBase]: For 1884/1985 co-relation queries the response was YES. [2024-10-11 17:16:56,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15866 conditions, 11923 events. 997/11923 cut-off events. For 1884/1985 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 131773 event pairs, 90 based on Foata normal form. 0/11080 useless extension candidates. Maximal degree in co-relation 15821. Up to 781 conditions per place. [2024-10-11 17:16:56,098 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 10 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2024-10-11 17:16:56,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 526 transitions, 1929 flow [2024-10-11 17:16:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2024-10-11 17:16:56,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-10-11 17:16:56,101 INFO L175 Difference]: Start difference. First operand has 443 places, 525 transitions, 1901 flow. Second operand 3 states and 1456 transitions. [2024-10-11 17:16:56,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 526 transitions, 1929 flow [2024-10-11 17:16:56,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 526 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:56,114 INFO L231 Difference]: Finished difference. Result has 442 places, 524 transitions, 1899 flow [2024-10-11 17:16:56,115 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=442, PETRI_TRANSITIONS=524} [2024-10-11 17:16:56,115 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -13 predicate places. [2024-10-11 17:16:56,115 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 524 transitions, 1899 flow [2024-10-11 17:16:56,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:56,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:56,116 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:16:56,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:16:56,116 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:16:56,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:56,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1527746212, now seen corresponding path program 1 times [2024-10-11 17:16:56,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204537393] [2024-10-11 17:16:56,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:56,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:16:56,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:56,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204537393] [2024-10-11 17:16:56,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204537393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:56,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:56,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:56,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818999246] [2024-10-11 17:16:56,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:56,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:56,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:56,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:56,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:57,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 518 [2024-10-11 17:16:57,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 524 transitions, 1899 flow. Second operand has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:57,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:57,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 518 [2024-10-11 17:16:57,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:03,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][535], [560#(= |#race~C~0| 0), 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 418#L85-4true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 640#true, 210#L51-10true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 526#true, Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 603#true, 507#(= |#race~N~0| 0), 39#L67-27true, Black: 533#true, 528#(= |#race~A~0| 0), 89#L59-10true]) [2024-10-11 17:17:03,027 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2024-10-11 17:17:03,027 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-10-11 17:17:03,027 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-10-11 17:17:03,027 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-10-11 17:17:03,136 INFO L124 PetriNetUnfolderBase]: 6087/33187 cut-off events. [2024-10-11 17:17:03,136 INFO L125 PetriNetUnfolderBase]: For 11985/12100 co-relation queries the response was YES. [2024-10-11 17:17:03,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55262 conditions, 33187 events. 6087/33187 cut-off events. For 11985/12100 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 406902 event pairs, 2256 based on Foata normal form. 0/31176 useless extension candidates. Maximal degree in co-relation 55216. Up to 8927 conditions per place. [2024-10-11 17:17:03,599 INFO L140 encePairwiseOnDemand]: 503/518 looper letters, 136 selfloop transitions, 77 changer transitions 0/584 dead transitions. [2024-10-11 17:17:03,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 584 transitions, 2629 flow [2024-10-11 17:17:03,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2749 transitions. [2024-10-11 17:17:03,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8844916344916345 [2024-10-11 17:17:03,604 INFO L175 Difference]: Start difference. First operand has 442 places, 524 transitions, 1899 flow. Second operand 6 states and 2749 transitions. [2024-10-11 17:17:03,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 584 transitions, 2629 flow [2024-10-11 17:17:03,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 584 transitions, 2625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:03,664 INFO L231 Difference]: Finished difference. Result has 450 places, 576 transitions, 2541 flow [2024-10-11 17:17:03,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2541, PETRI_PLACES=450, PETRI_TRANSITIONS=576} [2024-10-11 17:17:03,665 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-10-11 17:17:03,665 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 576 transitions, 2541 flow [2024-10-11 17:17:03,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:03,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:03,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:17:03,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:17:03,666 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:17:03,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1150734015, now seen corresponding path program 1 times [2024-10-11 17:17:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:03,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721870521] [2024-10-11 17:17:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:03,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:17:05,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:05,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721870521] [2024-10-11 17:17:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721870521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:05,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:05,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-11 17:17:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191151467] [2024-10-11 17:17:05,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:05,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 17:17:05,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:05,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 17:17:05,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-10-11 17:17:09,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 518 [2024-10-11 17:17:09,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 576 transitions, 2541 flow. Second operand has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:09,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:09,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 518 [2024-10-11 17:17:09,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:16,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1414] thread2EXIT-->L87: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), 428#L67-10true, Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 282#L87true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-11 17:17:16,321 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-10-11 17:17:16,321 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-11 17:17:16,321 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-11 17:17:16,321 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-11 17:17:17,090 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1414] thread2EXIT-->L87: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), 428#L67-10true, Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 282#L87true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-11 17:17:17,090 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-10-11 17:17:17,090 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-11 17:17:17,090 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-11 17:17:17,090 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-10-11 17:17:17,091 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-11 17:17:19,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][409], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, 39#L67-27true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 387#L54true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 89#L59-10true]) [2024-10-11 17:17:19,683 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-10-11 17:17:19,684 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-10-11 17:17:19,684 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-10-11 17:17:19,684 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-10-11 17:17:19,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L67-10-->L67-11: Formula: (= |v_#race~B~0_4| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_4|} AuxVars[] AssignedVars[#race~B~0][285], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, 202#L59-3true, 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 85#L67-11true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 384#L50-7true]) [2024-10-11 17:17:19,789 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2024-10-11 17:17:19,789 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-10-11 17:17:19,790 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2024-10-11 17:17:19,790 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-10-11 17:17:19,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][409], [560#(= |#race~C~0| 0), 308#L86-1true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, 39#L67-27true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 89#L59-10true]) [2024-10-11 17:17:19,932 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-10-11 17:17:19,932 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-10-11 17:17:19,932 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-10-11 17:17:19,932 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2024-10-11 17:17:22,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L67-28-->L67-29: Formula: (= (store |v_#race_46| v_~C~0.base_4 (store (select |v_#race_46| v_~C~0.base_4) (+ 2 v_~C~0.offset_4 (* |v_thread3Thread1of1ForFork2_~i~2#1_43| 4)) |v_thread3Thread1of1ForFork2_#t~nondet12#1_7|)) |v_#race_45|) InVars {#race=|v_#race_46|, ~C~0.offset=v_~C~0.offset_4, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_4, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_43|} OutVars{#race=|v_#race_45|, ~C~0.offset=v_~C~0.offset_4, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_4, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_43|} AuxVars[] AssignedVars[#race][578], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 210#L51-10true, Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, 393#L67-29true, 142#L58-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (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))]) [2024-10-11 17:17:22,266 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2024-10-11 17:17:22,266 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-10-11 17:17:22,266 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-10-11 17:17:22,266 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-10-11 17:17:22,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][411], [560#(= |#race~C~0| 0), 308#L86-1true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, 39#L67-27true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 487#L59-8true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-11 17:17:22,301 INFO L294 olderBase$Statistics]: this new event has 402 ancestors and is cut-off event [2024-10-11 17:17:22,302 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-10-11 17:17:22,302 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-10-11 17:17:22,302 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2024-10-11 17:17:22,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][411], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, 39#L67-27true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 387#L54true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 487#L59-8true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-11 17:17:22,302 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2024-10-11 17:17:22,302 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-10-11 17:17:22,302 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-11 17:17:22,302 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-11 17:17:22,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1350] L67-29-->L67-30: Formula: (= (store |v_#race_48| v_~C~0.base_5 (store (select |v_#race_48| v_~C~0.base_5) (+ 3 v_~C~0.offset_5 (* |v_thread3Thread1of1ForFork2_~i~2#1_45| 4)) |v_thread3Thread1of1ForFork2_#t~nondet12#1_9|)) |v_#race_47|) InVars {#race=|v_#race_48|, ~C~0.offset=v_~C~0.offset_5, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_45|} OutVars{#race=|v_#race_47|, ~C~0.offset=v_~C~0.offset_5, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_45|} AuxVars[] AssignedVars[#race][596], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 210#L51-10true, Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, 142#L58-7true, 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 380#L67-30true, 725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (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))]) [2024-10-11 17:17:22,312 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2024-10-11 17:17:22,312 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-11 17:17:22,312 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-11 17:17:22,312 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-11 17:17:22,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][409], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, 39#L67-27true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 80#L59-9true, 387#L54true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-11 17:17:22,343 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2024-10-11 17:17:22,343 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-11 17:17:22,343 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-11 17:17:22,343 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-11 17:17:22,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][409], [560#(= |#race~C~0| 0), 308#L86-1true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, 39#L67-27true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 80#L59-9true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-11 17:17:22,343 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2024-10-11 17:17:22,343 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-10-11 17:17:22,343 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-10-11 17:17:22,344 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-10-11 17:17:22,621 INFO L124 PetriNetUnfolderBase]: 8434/64624 cut-off events. [2024-10-11 17:17:22,621 INFO L125 PetriNetUnfolderBase]: For 49248/54923 co-relation queries the response was YES. [2024-10-11 17:17:23,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109651 conditions, 64624 events. 8434/64624 cut-off events. For 49248/54923 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 931327 event pairs, 1041 based on Foata normal form. 501/61132 useless extension candidates. Maximal degree in co-relation 109598. Up to 4505 conditions per place. [2024-10-11 17:17:23,372 INFO L140 encePairwiseOnDemand]: 483/518 looper letters, 493 selfloop transitions, 44 changer transitions 0/939 dead transitions. [2024-10-11 17:17:23,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 939 transitions, 7205 flow [2024-10-11 17:17:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 17:17:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-10-11 17:17:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13770 transitions. [2024-10-11 17:17:23,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.830719111969112 [2024-10-11 17:17:23,618 INFO L175 Difference]: Start difference. First operand has 450 places, 576 transitions, 2541 flow. Second operand 32 states and 13770 transitions. [2024-10-11 17:17:23,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 939 transitions, 7205 flow [2024-10-11 17:17:23,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 939 transitions, 7169 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:23,884 INFO L231 Difference]: Finished difference. Result has 485 places, 593 transitions, 2700 flow [2024-10-11 17:17:23,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2700, PETRI_PLACES=485, PETRI_TRANSITIONS=593} [2024-10-11 17:17:23,885 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, 30 predicate places. [2024-10-11 17:17:23,886 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 593 transitions, 2700 flow [2024-10-11 17:17:23,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:23,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:23,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:17:23,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:17:23,889 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:17:23,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash -528468227, now seen corresponding path program 2 times [2024-10-11 17:17:23,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:23,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163167574] [2024-10-11 17:17:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:23,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:17:25,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:25,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163167574] [2024-10-11 17:17:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163167574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:25,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:25,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-11 17:17:25,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232513321] [2024-10-11 17:17:25,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:25,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 17:17:25,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:25,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 17:17:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-10-11 17:17:29,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 518 [2024-10-11 17:17:29,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 593 transitions, 2700 flow. Second operand has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:29,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:29,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 518 [2024-10-11 17:17:29,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:31,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L59-2-->L59-3: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][291], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 723#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 799#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 721#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 727#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (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)), Black: 725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (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)), 202#L59-3true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 387#L54true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 85#L67-11true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-11 17:17:31,991 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is cut-off event [2024-10-11 17:17:31,991 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-10-11 17:17:31,991 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2024-10-11 17:17:31,991 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-10-11 17:17:32,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L59-2-->L59-3: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][291], [560#(= |#race~C~0| 0), 308#L86-1true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 723#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 799#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 533#true, Black: 721#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 727#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (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)), Black: 725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (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)), 202#L59-3true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 85#L67-11true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-10-11 17:17:32,571 INFO L294 olderBase$Statistics]: this new event has 314 ancestors and is cut-off event [2024-10-11 17:17:32,571 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-11 17:17:32,572 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-11 17:17:32,572 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event