./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:33:52,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:33:52,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:33:52,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:33:52,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:33:52,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:33:52,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:33:52,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:33:52,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:33:52,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:33:52,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:33:52,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:33:52,433 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:33:52,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:33:52,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:33:52,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:33:52,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:33:52,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:33:52,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:33:52,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:33:52,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:33:52,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:33:52,440 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:33:52,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:33:52,441 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:33:52,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:33:52,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:33:52,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:33:52,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:33:52,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:33:52,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:33:52,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:33:52,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:33:52,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:33:52,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:33:52,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:33:52,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:33:52,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:33:52,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:33:52,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:33:52,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:33:52,447 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 [2024-11-12 12:33:52,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:33:52,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:33:52,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:33:52,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:33:52,751 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:33:52,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2024-11-12 12:33:54,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:33:54,422 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:33:54,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2024-11-12 12:33:54,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00b6e265c/e3c28b691521429f9648dd4de8ea613d/FLAGb33a8d913 [2024-11-12 12:33:54,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00b6e265c/e3c28b691521429f9648dd4de8ea613d [2024-11-12 12:33:54,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:33:54,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:33:54,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:33:54,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:33:54,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:33:54,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:33:54" (1/1) ... [2024-11-12 12:33:54,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7997cb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:54, skipping insertion in model container [2024-11-12 12:33:54,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:33:54" (1/1) ... [2024-11-12 12:33:54,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:33:54,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:33:54,969 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:33:55,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:33:55,060 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:33:55,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55 WrapperNode [2024-11-12 12:33:55,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:33:55,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:33:55,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:33:55,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:33:55,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55" (1/1) ... [2024-11-12 12:33:55,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55" (1/1) ... [2024-11-12 12:33:55,117 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 210 [2024-11-12 12:33:55,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:33:55,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:33:55,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:33:55,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:33:55,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55" (1/1) ... [2024-11-12 12:33:55,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55" (1/1) ... [2024-11-12 12:33:55,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55" (1/1) ... [2024-11-12 12:33:55,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55" (1/1) ... [2024-11-12 12:33:55,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55" (1/1) ... [2024-11-12 12:33:55,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55" (1/1) ... [2024-11-12 12:33:55,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55" (1/1) ... [2024-11-12 12:33:55,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55" (1/1) ... [2024-11-12 12:33:55,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:33:55,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:33:55,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:33:55,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:33:55,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55" (1/1) ... [2024-11-12 12:33:55,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:33:55,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:33:55,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:33:55,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:33:55,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:33:55,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:33:55,263 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 12:33:55,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:33:55,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 12:33:55,263 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-12 12:33:55,263 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-12 12:33:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:33:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:33:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 12:33:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:33:55,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:33:55,267 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:33:55,424 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:33:55,428 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:33:55,719 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:33:55,720 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:33:55,768 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:33:55,769 INFO L316 CfgBuilder]: Removed 18 assume(true) statements. [2024-11-12 12:33:55,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:33:55 BoogieIcfgContainer [2024-11-12 12:33:55,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:33:55,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:33:55,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:33:55,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:33:55,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:33:54" (1/3) ... [2024-11-12 12:33:55,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd05b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:33:55, skipping insertion in model container [2024-11-12 12:33:55,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:55" (2/3) ... [2024-11-12 12:33:55,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd05b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:33:55, skipping insertion in model container [2024-11-12 12:33:55,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:33:55" (3/3) ... [2024-11-12 12:33:55,778 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2024-11-12 12:33:55,795 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:33:55,795 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-12 12:33:55,796 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:33:55,897 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-12 12:33:55,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 210 transitions, 427 flow [2024-11-12 12:33:56,081 INFO L124 PetriNetUnfolderBase]: 36/309 cut-off events. [2024-11-12 12:33:56,082 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:33:56,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 309 events. 36/309 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1292 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 179. Up to 6 conditions per place. [2024-11-12 12:33:56,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 210 transitions, 427 flow [2024-11-12 12:33:56,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 210 transitions, 427 flow [2024-11-12 12:33:56,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:33:56,123 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;@6899c80a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:33:56,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-12 12:33:56,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:33:56,143 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-11-12 12:33:56,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:33:56,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:56,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:56,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-12 12:33:56,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1643993819, now seen corresponding path program 1 times [2024-11-12 12:33:56,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:56,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510275991] [2024-11-12 12:33:56,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:56,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:56,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:56,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510275991] [2024-11-12 12:33:56,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510275991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:56,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:56,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:33:56,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195572913] [2024-11-12 12:33:56,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:56,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 12:33:56,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:56,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 12:33:56,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 12:33:56,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2024-11-12 12:33:56,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 210 transitions, 427 flow. Second operand has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:56,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:56,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2024-11-12 12:33:56,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:56,639 INFO L124 PetriNetUnfolderBase]: 82/853 cut-off events. [2024-11-12 12:33:56,639 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 12:33:56,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 853 events. 82/853 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5123 event pairs, 72 based on Foata normal form. 153/900 useless extension candidates. Maximal degree in co-relation 898. Up to 172 conditions per place. [2024-11-12 12:33:56,653 INFO L140 encePairwiseOnDemand]: 188/210 looper letters, 19 selfloop transitions, 0 changer transitions 0/184 dead transitions. [2024-11-12 12:33:56,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 184 transitions, 413 flow [2024-11-12 12:33:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 12:33:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-12 12:33:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 375 transitions. [2024-11-12 12:33:56,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8928571428571429 [2024-11-12 12:33:56,674 INFO L175 Difference]: Start difference. First operand has 189 places, 210 transitions, 427 flow. Second operand 2 states and 375 transitions. [2024-11-12 12:33:56,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 184 transitions, 413 flow [2024-11-12 12:33:56,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 184 transitions, 413 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:33:56,684 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 375 flow [2024-11-12 12:33:56,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=375, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2024-11-12 12:33:56,690 INFO L279 CegarLoopForPetriNet]: 189 programPoint places, -3 predicate places. [2024-11-12 12:33:56,690 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 375 flow [2024-11-12 12:33:56,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:56,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:56,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:56,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:33:56,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-12 12:33:56,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:56,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1641143443, now seen corresponding path program 1 times [2024-11-12 12:33:56,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:56,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346987063] [2024-11-12 12:33:56,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:56,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:56,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:56,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346987063] [2024-11-12 12:33:56,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346987063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:56,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:56,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:33:56,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246672567] [2024-11-12 12:33:56,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:56,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:56,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:56,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:56,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:56,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 210 [2024-11-12 12:33:56,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:56,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:56,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 210 [2024-11-12 12:33:56,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:57,145 INFO L124 PetriNetUnfolderBase]: 110/1056 cut-off events. [2024-11-12 12:33:57,145 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 12:33:57,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 1056 events. 110/1056 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6685 event pairs, 88 based on Foata normal form. 1/941 useless extension candidates. Maximal degree in co-relation 1301. Up to 232 conditions per place. [2024-11-12 12:33:57,155 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 32 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2024-11-12 12:33:57,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 193 transitions, 461 flow [2024-11-12 12:33:57,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2024-11-12 12:33:57,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2024-11-12 12:33:57,162 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 375 flow. Second operand 3 states and 518 transitions. [2024-11-12 12:33:57,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 193 transitions, 461 flow [2024-11-12 12:33:57,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 193 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:33:57,168 INFO L231 Difference]: Finished difference. Result has 189 places, 184 transitions, 383 flow [2024-11-12 12:33:57,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=189, PETRI_TRANSITIONS=184} [2024-11-12 12:33:57,169 INFO L279 CegarLoopForPetriNet]: 189 programPoint places, 0 predicate places. [2024-11-12 12:33:57,170 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 184 transitions, 383 flow [2024-11-12 12:33:57,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:57,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:57,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:57,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:33:57,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-12 12:33:57,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash 224006694, now seen corresponding path program 1 times [2024-11-12 12:33:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:57,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221142273] [2024-11-12 12:33:57,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:57,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:57,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:57,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221142273] [2024-11-12 12:33:57,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221142273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:57,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:57,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:33:57,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086045510] [2024-11-12 12:33:57,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:57,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:33:57,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:57,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:33:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:33:57,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 210 [2024-11-12 12:33:57,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 184 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:57,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:57,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 210 [2024-11-12 12:33:57,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:58,119 INFO L124 PetriNetUnfolderBase]: 202/1301 cut-off events. [2024-11-12 12:33:58,120 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-12 12:33:58,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1777 conditions, 1301 events. 202/1301 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 9029 event pairs, 136 based on Foata normal form. 0/1180 useless extension candidates. Maximal degree in co-relation 1771. Up to 335 conditions per place. [2024-11-12 12:33:58,130 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 67 selfloop transitions, 5 changer transitions 0/219 dead transitions. [2024-11-12 12:33:58,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 219 transitions, 597 flow [2024-11-12 12:33:58,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:33:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:33:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 967 transitions. [2024-11-12 12:33:58,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7674603174603175 [2024-11-12 12:33:58,135 INFO L175 Difference]: Start difference. First operand has 189 places, 184 transitions, 383 flow. Second operand 6 states and 967 transitions. [2024-11-12 12:33:58,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 219 transitions, 597 flow [2024-11-12 12:33:58,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 219 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:33:58,142 INFO L231 Difference]: Finished difference. Result has 191 places, 183 transitions, 387 flow [2024-11-12 12:33:58,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=191, PETRI_TRANSITIONS=183} [2024-11-12 12:33:58,144 INFO L279 CegarLoopForPetriNet]: 189 programPoint places, 2 predicate places. [2024-11-12 12:33:58,145 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 183 transitions, 387 flow [2024-11-12 12:33:58,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:58,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:58,146 INFO L206 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] [2024-11-12 12:33:58,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:33:58,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-12 12:33:58,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash -336056165, now seen corresponding path program 1 times [2024-11-12 12:33:58,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:58,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916156262] [2024-11-12 12:33:58,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:58,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:58,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916156262] [2024-11-12 12:33:58,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916156262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:58,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:58,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:33:58,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574619744] [2024-11-12 12:33:58,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:58,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:58,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:58,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:58,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:58,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 210 [2024-11-12 12:33:58,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 183 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:58,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:58,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 210 [2024-11-12 12:33:58,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:58,559 INFO L124 PetriNetUnfolderBase]: 442/2623 cut-off events. [2024-11-12 12:33:58,559 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-12 12:33:58,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3616 conditions, 2623 events. 442/2623 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21163 event pairs, 177 based on Foata normal form. 0/2379 useless extension candidates. Maximal degree in co-relation 3610. Up to 608 conditions per place. [2024-11-12 12:33:58,573 INFO L140 encePairwiseOnDemand]: 185/210 looper letters, 62 selfloop transitions, 18 changer transitions 0/219 dead transitions. [2024-11-12 12:33:58,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 219 transitions, 622 flow [2024-11-12 12:33:58,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2024-11-12 12:33:58,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8142857142857143 [2024-11-12 12:33:58,575 INFO L175 Difference]: Start difference. First operand has 191 places, 183 transitions, 387 flow. Second operand 3 states and 513 transitions. [2024-11-12 12:33:58,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 219 transitions, 622 flow [2024-11-12 12:33:58,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 219 transitions, 612 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:33:58,580 INFO L231 Difference]: Finished difference. Result has 190 places, 201 transitions, 535 flow [2024-11-12 12:33:58,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=535, PETRI_PLACES=190, PETRI_TRANSITIONS=201} [2024-11-12 12:33:58,582 INFO L279 CegarLoopForPetriNet]: 189 programPoint places, 1 predicate places. [2024-11-12 12:33:58,583 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 201 transitions, 535 flow [2024-11-12 12:33:58,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:58,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:58,584 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:58,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:33:58,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-12 12:33:58,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:58,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1779233426, now seen corresponding path program 1 times [2024-11-12 12:33:58,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:58,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518055237] [2024-11-12 12:33:58,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:58,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:33:58,612 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:33:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:33:58,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:33:58,656 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:33:58,657 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2024-11-12 12:33:58,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-11-12 12:33:58,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-11-12 12:33:58,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-11-12 12:33:58,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-11-12 12:33:58,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2024-11-12 12:33:58,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-11-12 12:33:58,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-11-12 12:33:58,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-11-12 12:33:58,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-11-12 12:33:58,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-11-12 12:33:58,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-11-12 12:33:58,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-11-12 12:33:58,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-11-12 12:33:58,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-11-12 12:33:58,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-11-12 12:33:58,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-11-12 12:33:58,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-11-12 12:33:58,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-11-12 12:33:58,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-11-12 12:33:58,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:33:58,667 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 12:33:58,669 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 12:33:58,670 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-12 12:33:58,703 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 12:33:58,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 289 transitions, 594 flow [2024-11-12 12:33:58,763 INFO L124 PetriNetUnfolderBase]: 62/515 cut-off events. [2024-11-12 12:33:58,763 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:33:58,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 515 events. 62/515 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2378 event pairs, 0 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 311. Up to 9 conditions per place. [2024-11-12 12:33:58,768 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 289 transitions, 594 flow [2024-11-12 12:33:58,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 289 transitions, 594 flow [2024-11-12 12:33:58,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:33:58,794 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;@6899c80a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:33:58,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-12 12:33:58,800 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:33:58,800 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-11-12 12:33:58,800 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:33:58,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:58,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:58,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-12 12:33:58,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2058564795, now seen corresponding path program 1 times [2024-11-12 12:33:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:58,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273930881] [2024-11-12 12:33:58,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:58,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:58,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273930881] [2024-11-12 12:33:58,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273930881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:58,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:58,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:33:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118104680] [2024-11-12 12:33:58,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:58,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 12:33:58,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:58,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 12:33:58,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 12:33:58,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 289 [2024-11-12 12:33:58,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 289 transitions, 594 flow. Second operand has 2 states, 2 states have (on average 225.5) internal successors, (451), 2 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:58,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:58,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 289 [2024-11-12 12:33:58,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:34:00,001 INFO L124 PetriNetUnfolderBase]: 1733/9097 cut-off events. [2024-11-12 12:34:00,002 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2024-11-12 12:34:00,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11797 conditions, 9097 events. 1733/9097 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 100917 event pairs, 1620 based on Foata normal form. 2258/10244 useless extension candidates. Maximal degree in co-relation 10589. Up to 2642 conditions per place. [2024-11-12 12:34:00,081 INFO L140 encePairwiseOnDemand]: 257/289 looper letters, 30 selfloop transitions, 0 changer transitions 0/251 dead transitions. [2024-11-12 12:34:00,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 251 transitions, 578 flow [2024-11-12 12:34:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 12:34:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-12 12:34:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 510 transitions. [2024-11-12 12:34:00,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2024-11-12 12:34:00,084 INFO L175 Difference]: Start difference. First operand has 258 places, 289 transitions, 594 flow. Second operand 2 states and 510 transitions. [2024-11-12 12:34:00,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 251 transitions, 578 flow [2024-11-12 12:34:00,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 251 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:34:00,091 INFO L231 Difference]: Finished difference. Result has 253 places, 251 transitions, 518 flow [2024-11-12 12:34:00,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=518, PETRI_PLACES=253, PETRI_TRANSITIONS=251} [2024-11-12 12:34:00,093 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -5 predicate places. [2024-11-12 12:34:00,093 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 251 transitions, 518 flow [2024-11-12 12:34:00,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 225.5) internal successors, (451), 2 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:00,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:34:00,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:34:00,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:34:00,094 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-12 12:34:00,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:34:00,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2055714419, now seen corresponding path program 1 times [2024-11-12 12:34:00,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:34:00,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206370747] [2024-11-12 12:34:00,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:34:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:34:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:34:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:34:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:34:00,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206370747] [2024-11-12 12:34:00,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206370747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:34:00,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:34:00,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:34:00,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154132790] [2024-11-12 12:34:00,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:34:00,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:34:00,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:34:00,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:34:00,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:34:00,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 289 [2024-11-12 12:34:00,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 251 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:00,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:34:00,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 289 [2024-11-12 12:34:00,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:34:01,752 INFO L124 PetriNetUnfolderBase]: 2529/12797 cut-off events. [2024-11-12 12:34:01,753 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-11-12 12:34:01,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16706 conditions, 12797 events. 2529/12797 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 150315 event pairs, 1098 based on Foata normal form. 1/11369 useless extension candidates. Maximal degree in co-relation 16701. Up to 3840 conditions per place. [2024-11-12 12:34:01,837 INFO L140 encePairwiseOnDemand]: 286/289 looper letters, 44 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2024-11-12 12:34:01,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 261 transitions, 630 flow [2024-11-12 12:34:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:34:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:34:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2024-11-12 12:34:01,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8085351787773933 [2024-11-12 12:34:01,840 INFO L175 Difference]: Start difference. First operand has 253 places, 251 transitions, 518 flow. Second operand 3 states and 701 transitions. [2024-11-12 12:34:01,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 261 transitions, 630 flow [2024-11-12 12:34:01,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 261 transitions, 630 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:34:01,846 INFO L231 Difference]: Finished difference. Result has 256 places, 252 transitions, 530 flow [2024-11-12 12:34:01,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=256, PETRI_TRANSITIONS=252} [2024-11-12 12:34:01,847 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -2 predicate places. [2024-11-12 12:34:01,847 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 252 transitions, 530 flow [2024-11-12 12:34:01,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:01,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:34:01,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:34:01,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:34:01,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-12 12:34:01,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:34:01,849 INFO L85 PathProgramCache]: Analyzing trace with hash 257208615, now seen corresponding path program 1 times [2024-11-12 12:34:01,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:34:01,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82246634] [2024-11-12 12:34:01,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:34:01,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:34:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:34:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:34:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:34:02,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82246634] [2024-11-12 12:34:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82246634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:34:02,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:34:02,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:34:02,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340093062] [2024-11-12 12:34:02,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:34:02,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:34:02,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:34:02,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:34:02,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:34:02,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 289 [2024-11-12 12:34:02,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 252 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:02,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:34:02,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 289 [2024-11-12 12:34:02,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:34:04,278 INFO L124 PetriNetUnfolderBase]: 4384/17285 cut-off events. [2024-11-12 12:34:04,278 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2024-11-12 12:34:04,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24452 conditions, 17285 events. 4384/17285 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 204989 event pairs, 2104 based on Foata normal form. 0/15593 useless extension candidates. Maximal degree in co-relation 24445. Up to 5258 conditions per place. [2024-11-12 12:34:04,398 INFO L140 encePairwiseOnDemand]: 283/289 looper letters, 114 selfloop transitions, 6 changer transitions 0/323 dead transitions. [2024-11-12 12:34:04,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 323 transitions, 912 flow [2024-11-12 12:34:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:34:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:34:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2024-11-12 12:34:04,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7820069204152249 [2024-11-12 12:34:04,402 INFO L175 Difference]: Start difference. First operand has 256 places, 252 transitions, 530 flow. Second operand 6 states and 1356 transitions. [2024-11-12 12:34:04,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 323 transitions, 912 flow [2024-11-12 12:34:04,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 323 transitions, 910 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:34:04,408 INFO L231 Difference]: Finished difference. Result has 259 places, 251 transitions, 538 flow [2024-11-12 12:34:04,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=259, PETRI_TRANSITIONS=251} [2024-11-12 12:34:04,410 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, 1 predicate places. [2024-11-12 12:34:04,411 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 251 transitions, 538 flow [2024-11-12 12:34:04,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:04,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:34:04,412 INFO L206 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] [2024-11-12 12:34:04,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:34:04,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-12 12:34:04,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:34:04,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1088174321, now seen corresponding path program 1 times [2024-11-12 12:34:04,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:34:04,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426323081] [2024-11-12 12:34:04,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:34:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:34:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:34:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:34:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:34:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426323081] [2024-11-12 12:34:04,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426323081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:34:04,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:34:04,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:34:04,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561202305] [2024-11-12 12:34:04,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:34:04,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:34:04,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:34:04,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:34:04,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:34:04,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 289 [2024-11-12 12:34:04,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 251 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:04,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:34:04,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 289 [2024-11-12 12:34:04,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:34:11,848 INFO L124 PetriNetUnfolderBase]: 26162/85747 cut-off events. [2024-11-12 12:34:11,848 INFO L125 PetriNetUnfolderBase]: For 552/552 co-relation queries the response was YES. [2024-11-12 12:34:12,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128050 conditions, 85747 events. 26162/85747 cut-off events. For 552/552 co-relation queries the response was YES. Maximal size of possible extension queue 1629. Compared 1195118 event pairs, 10477 based on Foata normal form. 0/76865 useless extension candidates. Maximal degree in co-relation 128043. Up to 26496 conditions per place. [2024-11-12 12:34:12,418 INFO L140 encePairwiseOnDemand]: 250/289 looper letters, 98 selfloop transitions, 28 changer transitions 0/308 dead transitions. [2024-11-12 12:34:12,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 308 transitions, 915 flow [2024-11-12 12:34:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:34:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:34:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2024-11-12 12:34:12,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.798154555940023 [2024-11-12 12:34:12,422 INFO L175 Difference]: Start difference. First operand has 259 places, 251 transitions, 538 flow. Second operand 3 states and 692 transitions. [2024-11-12 12:34:12,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 308 transitions, 915 flow [2024-11-12 12:34:12,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 308 transitions, 903 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:34:12,433 INFO L231 Difference]: Finished difference. Result has 258 places, 279 transitions, 772 flow [2024-11-12 12:34:12,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=258, PETRI_TRANSITIONS=279} [2024-11-12 12:34:12,435 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, 0 predicate places. [2024-11-12 12:34:12,436 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 279 transitions, 772 flow [2024-11-12 12:34:12,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:12,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:34:12,437 INFO L206 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] [2024-11-12 12:34:12,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:34:12,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-12 12:34:12,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:34:12,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1058884623, now seen corresponding path program 1 times [2024-11-12 12:34:12,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:34:12,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140158398] [2024-11-12 12:34:12,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:34:12,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:34:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:34:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:34:12,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:34:12,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140158398] [2024-11-12 12:34:12,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140158398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:34:12,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:34:12,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:34:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263272018] [2024-11-12 12:34:12,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:34:12,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:34:12,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:34:12,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:34:12,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:34:12,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 289 [2024-11-12 12:34:12,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 279 transitions, 772 flow. Second operand has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:12,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:34:12,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 289 [2024-11-12 12:34:12,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:34:14,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 248#L713-5true, Black: 273#true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 48#L706-24true, 245#L702-5true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,076 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-12 12:34:14,076 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-12 12:34:14,076 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-12 12:34:14,076 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-12 12:34:14,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [75#L706-25true, 278#true, 248#L713-5true, Black: 273#true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 245#L702-5true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,172 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2024-11-12 12:34:14,172 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2024-11-12 12:34:14,172 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2024-11-12 12:34:14,172 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2024-11-12 12:34:14,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 248#L713-5true, Black: 273#true, 96#L702-6true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 48#L706-24true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,265 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2024-11-12 12:34:14,265 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2024-11-12 12:34:14,265 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2024-11-12 12:34:14,265 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2024-11-12 12:34:14,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 90#L711-17true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 245#L702-5true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,270 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2024-11-12 12:34:14,271 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2024-11-12 12:34:14,271 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2024-11-12 12:34:14,271 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2024-11-12 12:34:14,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 111#L706-5true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 48#L706-24true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,346 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2024-11-12 12:34:14,346 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-12 12:34:14,346 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-12 12:34:14,346 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-12 12:34:14,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [75#L706-25true, 278#true, 248#L713-5true, Black: 273#true, 96#L702-6true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,571 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2024-11-12 12:34:14,571 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-11-12 12:34:14,571 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-11-12 12:34:14,571 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-11-12 12:34:14,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 90#L711-17true, 96#L702-6true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,580 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2024-11-12 12:34:14,580 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-11-12 12:34:14,581 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-11-12 12:34:14,581 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-11-12 12:34:14,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, 101#L711-18true, Black: 275#(= |#race~x~0| 0), 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 245#L702-5true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,582 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2024-11-12 12:34:14,582 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-11-12 12:34:14,582 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-11-12 12:34:14,582 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-11-12 12:34:14,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 75#L706-25true, 111#L706-5true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,636 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,636 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,636 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,636 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, 101#L711-18true, Black: 275#(= |#race~x~0| 0), 96#L702-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,654 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2024-11-12 12:34:14,654 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-12 12:34:14,654 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-12 12:34:14,654 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-12 12:34:14,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 198#L712true, 245#L702-5true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,654 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2024-11-12 12:34:14,654 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-12 12:34:14,655 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-12 12:34:14,655 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-12 12:34:14,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 248#L713-5true, Black: 273#true, 138#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 48#L706-24true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,697 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,698 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,698 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,698 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, Black: 275#(= |#race~x~0| 0), 90#L711-17true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 148#L706-16true, 48#L706-24true, 273#true, 261#true]) [2024-11-12 12:34:14,700 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,701 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,701 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,701 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, 111#L706-5true, Black: 275#(= |#race~x~0| 0), 90#L711-17true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,702 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,702 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,702 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,702 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 96#L702-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 198#L712true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,728 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,728 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,728 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,729 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 14#L712-3true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 245#L702-5true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,730 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,730 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,730 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,731 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-12 12:34:14,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [75#L706-25true, 278#true, 248#L713-5true, Black: 273#true, 138#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,787 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,788 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,788 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,788 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, 101#L711-18true, Black: 275#(= |#race~x~0| 0), 257#true, 148#L706-16true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 48#L706-24true, 273#true, 261#true]) [2024-11-12 12:34:14,796 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,796 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,796 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,796 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, 75#L706-25true, Black: 275#(= |#race~x~0| 0), 90#L711-17true, 257#true, 259#true, 148#L706-16true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 273#true, 261#true]) [2024-11-12 12:34:14,797 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,797 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,797 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,798 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 90#L711-17true, 138#L706-6true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,798 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,798 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,799 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,799 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,799 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, 111#L706-5true, 101#L711-18true, Black: 275#(= |#race~x~0| 0), 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,799 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,799 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,799 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,800 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 14#L712-3true, 96#L702-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,819 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,819 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,819 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,819 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([926] L702-9-->L702-12: Formula: (and (= (store |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65| (store (select |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65|) |v_~#__global_lock~0.offset_65| 0)) |v_#pthreadsMutex_159|) (= |v_t_funThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_160|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_159|, t_funThread1of2ForFork0_#t~ret5#1=|v_t_funThread1of2ForFork0_#t~ret5#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret5#1][174], [278#true, 90#L711-17true, Black: 273#true, 169#L702-12true, 7#L706-29true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,820 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,820 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,820 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,820 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-12 12:34:14,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 248#L713-5true, Black: 273#true, 96#L702-6true, 257#true, 7#L706-29true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,821 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,821 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,821 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,821 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, Black: 275#(= |#race~x~0| 0), 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 198#L712true, 148#L706-16true, 48#L706-24true, 273#true, 261#true]) [2024-11-12 12:34:14,871 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,871 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,871 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,871 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [75#L706-25true, 278#true, 101#L711-18true, Black: 275#(= |#race~x~0| 0), 257#true, 148#L706-16true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 261#true]) [2024-11-12 12:34:14,871 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,871 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,871 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,872 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, 101#L711-18true, Black: 275#(= |#race~x~0| 0), 138#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,873 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,873 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,873 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,873 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, 111#L706-5true, Black: 275#(= |#race~x~0| 0), 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 198#L712true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,873 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,873 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,873 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,873 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 248#L713-5true, Black: 273#true, 257#true, 7#L706-29true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 245#L702-5true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,892 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is not cut-off event [2024-11-12 12:34:14,892 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2024-11-12 12:34:14,892 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2024-11-12 12:34:14,892 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2024-11-12 12:34:14,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([926] L702-9-->L702-12: Formula: (and (= (store |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65| (store (select |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65|) |v_~#__global_lock~0.offset_65| 0)) |v_#pthreadsMutex_159|) (= |v_t_funThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_160|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_159|, t_funThread1of2ForFork0_#t~ret5#1=|v_t_funThread1of2ForFork0_#t~ret5#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret5#1][174], [278#true, 101#L711-18true, Black: 273#true, 257#true, 7#L706-29true, 169#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,896 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,896 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,896 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,896 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-12 12:34:14,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, Black: 275#(= |#race~x~0| 0), 14#L712-3true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 148#L706-16true, 48#L706-24true, 273#true, 261#true]) [2024-11-12 12:34:14,946 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,947 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,947 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,947 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [75#L706-25true, 278#true, Black: 275#(= |#race~x~0| 0), 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 198#L712true, 148#L706-16true, 273#true, 261#true]) [2024-11-12 12:34:14,947 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,947 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,947 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,947 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 58#L706-10true, 48#L706-24true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,948 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2024-11-12 12:34:14,948 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:14,948 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:14,948 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:14,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 138#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 198#L712true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,949 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,949 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,949 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,949 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, 111#L706-5true, Black: 275#(= |#race~x~0| 0), 14#L712-3true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,949 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,950 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,950 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,950 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 248#L713-5true, Black: 273#true, 96#L702-6true, 257#true, 7#L706-29true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,963 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is not cut-off event [2024-11-12 12:34:14,963 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2024-11-12 12:34:14,963 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2024-11-12 12:34:14,963 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2024-11-12 12:34:14,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 248#L713-5true, Black: 273#true, 110#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 257#true, 7#L706-29true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,969 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is not cut-off event [2024-11-12 12:34:14,969 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2024-11-12 12:34:14,969 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2024-11-12 12:34:14,969 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2024-11-12 12:34:14,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([926] L702-9-->L702-12: Formula: (and (= (store |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65| (store (select |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65|) |v_~#__global_lock~0.offset_65| 0)) |v_#pthreadsMutex_159|) (= |v_t_funThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_160|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_159|, t_funThread1of2ForFork0_#t~ret5#1=|v_t_funThread1of2ForFork0_#t~ret5#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret5#1][174], [278#true, Black: 273#true, 257#true, 169#L702-12true, 7#L706-29true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 198#L712true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:14,972 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,972 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,972 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,972 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 257#true, 86#L713-3true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 245#L702-5true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:14,973 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,973 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,973 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:14,973 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-12 12:34:15,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, 75#L706-25true, Black: 275#(= |#race~x~0| 0), 14#L712-3true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 148#L706-16true, 273#true, 261#true]) [2024-11-12 12:34:15,021 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,021 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,021 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,021 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 75#L706-25true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 58#L706-10true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:15,022 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2024-11-12 12:34:15,022 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-11-12 12:34:15,022 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-11-12 12:34:15,022 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-11-12 12:34:15,023 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 14#L712-3true, 138#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:15,023 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,023 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,023 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,023 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,023 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 248#L713-5true, Black: 273#true, 138#L706-6true, 7#L706-29true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:15,024 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2024-11-12 12:34:15,024 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-11-12 12:34:15,024 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-11-12 12:34:15,024 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-11-12 12:34:15,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 96#L702-6true, 257#true, 86#L713-3true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:15,047 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,047 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,047 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,047 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([926] L702-9-->L702-12: Formula: (and (= (store |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65| (store (select |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65|) |v_~#__global_lock~0.offset_65| 0)) |v_#pthreadsMutex_159|) (= |v_t_funThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_160|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_159|, t_funThread1of2ForFork0_#t~ret5#1=|v_t_funThread1of2ForFork0_#t~ret5#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret5#1][174], [278#true, Black: 273#true, 14#L712-3true, 169#L702-12true, 257#true, 7#L706-29true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:15,047 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,047 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,047 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,048 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-12 12:34:15,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 111#L706-5true, 248#L713-5true, Black: 273#true, 257#true, 7#L706-29true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:15,096 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is not cut-off event [2024-11-12 12:34:15,096 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is not cut-off event [2024-11-12 12:34:15,096 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is not cut-off event [2024-11-12 12:34:15,096 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is not cut-off event [2024-11-12 12:34:15,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 58#L706-10true, 275#(= |#race~x~0| 0), 215#t_funErr4ASSERT_VIOLATIONDATA_RACEtrue, 261#true]) [2024-11-12 12:34:15,157 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2024-11-12 12:34:15,157 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2024-11-12 12:34:15,157 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2024-11-12 12:34:15,157 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2024-11-12 12:34:15,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 248#L713-5true, Black: 273#true, 138#L706-6true, 257#true, 7#L706-29true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:15,166 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2024-11-12 12:34:15,166 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2024-11-12 12:34:15,166 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2024-11-12 12:34:15,166 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2024-11-12 12:34:15,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 248#L713-5true, Black: 273#true, 143#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 257#true, 7#L706-29true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:15,172 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2024-11-12 12:34:15,172 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2024-11-12 12:34:15,172 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2024-11-12 12:34:15,172 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2024-11-12 12:34:15,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, Black: 275#(= |#race~x~0| 0), 257#true, 86#L713-3true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 148#L706-16true, 48#L706-24true, 273#true, 261#true]) [2024-11-12 12:34:15,175 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2024-11-12 12:34:15,175 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-12 12:34:15,175 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-12 12:34:15,175 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-12 12:34:15,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, 111#L706-5true, Black: 275#(= |#race~x~0| 0), 257#true, 86#L713-3true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:15,177 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2024-11-12 12:34:15,177 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-12 12:34:15,177 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-12 12:34:15,177 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-12 12:34:15,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, 75#L706-25true, Black: 275#(= |#race~x~0| 0), 257#true, 86#L713-3true, 148#L706-16true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 261#true]) [2024-11-12 12:34:15,266 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2024-11-12 12:34:15,267 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-12 12:34:15,267 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-12 12:34:15,267 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-12 12:34:15,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L706-32-->L706-35: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 138#L706-6true, 257#true, 86#L713-3true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 218#L706-35true, 273#true, 261#true]) [2024-11-12 12:34:15,267 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2024-11-12 12:34:15,267 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-12 12:34:15,267 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-12 12:34:15,268 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-12 12:34:15,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([926] L702-9-->L702-12: Formula: (and (= (store |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65| (store (select |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65|) |v_~#__global_lock~0.offset_65| 0)) |v_#pthreadsMutex_159|) (= |v_t_funThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_160|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_159|, t_funThread1of2ForFork0_#t~ret5#1=|v_t_funThread1of2ForFork0_#t~ret5#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret5#1][174], [278#true, Black: 273#true, 257#true, 7#L706-29true, 86#L713-3true, 169#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:15,304 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2024-11-12 12:34:15,304 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-12 12:34:15,304 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-12 12:34:15,304 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-12 12:34:15,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 248#L713-5true, Black: 273#true, 257#true, 7#L706-29true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 58#L706-10true, 275#(= |#race~x~0| 0), 261#true]) [2024-11-12 12:34:15,763 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is not cut-off event [2024-11-12 12:34:15,764 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2024-11-12 12:34:15,764 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2024-11-12 12:34:15,764 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2024-11-12 12:34:19,388 INFO L124 PetriNetUnfolderBase]: 16128/73456 cut-off events. [2024-11-12 12:34:19,389 INFO L125 PetriNetUnfolderBase]: For 5385/5767 co-relation queries the response was YES. [2024-11-12 12:34:19,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110864 conditions, 73456 events. 16128/73456 cut-off events. For 5385/5767 co-relation queries the response was YES. Maximal size of possible extension queue 1384. Compared 1105597 event pairs, 7429 based on Foata normal form. 10/65914 useless extension candidates. Maximal degree in co-relation 110856. Up to 15386 conditions per place. [2024-11-12 12:34:19,777 INFO L140 encePairwiseOnDemand]: 284/289 looper letters, 81 selfloop transitions, 5 changer transitions 0/326 dead transitions. [2024-11-12 12:34:19,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 326 transitions, 1038 flow [2024-11-12 12:34:19,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:34:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:34:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1383 transitions. [2024-11-12 12:34:19,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7975778546712803 [2024-11-12 12:34:19,781 INFO L175 Difference]: Start difference. First operand has 258 places, 279 transitions, 772 flow. Second operand 6 states and 1383 transitions. [2024-11-12 12:34:19,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 326 transitions, 1038 flow [2024-11-12 12:34:19,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 326 transitions, 982 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:34:19,856 INFO L231 Difference]: Finished difference. Result has 264 places, 281 transitions, 742 flow [2024-11-12 12:34:19,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=264, PETRI_TRANSITIONS=281} [2024-11-12 12:34:19,857 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, 6 predicate places. [2024-11-12 12:34:19,858 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 281 transitions, 742 flow [2024-11-12 12:34:19,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:19,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:34:19,859 INFO L206 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] [2024-11-12 12:34:19,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:34:19,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-12 12:34:19,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:34:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1908698949, now seen corresponding path program 1 times [2024-11-12 12:34:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:34:19,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620059655] [2024-11-12 12:34:19,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:34:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:34:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:34:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:34:19,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:34:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620059655] [2024-11-12 12:34:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620059655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:34:19,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:34:19,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:34:19,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260332164] [2024-11-12 12:34:19,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:34:19,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:34:19,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:34:19,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:34:19,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:34:19,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 289 [2024-11-12 12:34:19,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 281 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:19,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:34:19,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 289 [2024-11-12 12:34:19,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:34:28,961 INFO L124 PetriNetUnfolderBase]: 21456/92249 cut-off events. [2024-11-12 12:34:28,961 INFO L125 PetriNetUnfolderBase]: For 825/871 co-relation queries the response was YES. [2024-11-12 12:34:29,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134535 conditions, 92249 events. 21456/92249 cut-off events. For 825/871 co-relation queries the response was YES. Maximal size of possible extension queue 2115. Compared 1432591 event pairs, 10067 based on Foata normal form. 0/82172 useless extension candidates. Maximal degree in co-relation 134524. Up to 17324 conditions per place. [2024-11-12 12:34:29,472 INFO L140 encePairwiseOnDemand]: 278/289 looper letters, 65 selfloop transitions, 9 changer transitions 0/312 dead transitions. [2024-11-12 12:34:29,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 312 transitions, 954 flow [2024-11-12 12:34:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:34:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:34:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2024-11-12 12:34:29,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8246828143021915 [2024-11-12 12:34:29,475 INFO L175 Difference]: Start difference. First operand has 264 places, 281 transitions, 742 flow. Second operand 3 states and 715 transitions. [2024-11-12 12:34:29,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 312 transitions, 954 flow [2024-11-12 12:34:29,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 312 transitions, 948 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-12 12:34:29,489 INFO L231 Difference]: Finished difference. Result has 265 places, 286 transitions, 796 flow [2024-11-12 12:34:29,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=265, PETRI_TRANSITIONS=286} [2024-11-12 12:34:29,490 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, 7 predicate places. [2024-11-12 12:34:29,490 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 286 transitions, 796 flow [2024-11-12 12:34:29,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:29,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:34:29,492 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:34:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:34:29,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-12 12:34:29,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:34:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash 279989366, now seen corresponding path program 1 times [2024-11-12 12:34:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:34:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587882612] [2024-11-12 12:34:29,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:34:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:34:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:34:29,523 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:34:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:34:29,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:34:29,546 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:34:29,546 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2024-11-12 12:34:29,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 26 remaining) [2024-11-12 12:34:29,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2024-11-12 12:34:29,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2024-11-12 12:34:29,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2024-11-12 12:34:29,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2024-11-12 12:34:29,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2024-11-12 12:34:29,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2024-11-12 12:34:29,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2024-11-12 12:34:29,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2024-11-12 12:34:29,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2024-11-12 12:34:29,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2024-11-12 12:34:29,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2024-11-12 12:34:29,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2024-11-12 12:34:29,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2024-11-12 12:34:29,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2024-11-12 12:34:29,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2024-11-12 12:34:29,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2024-11-12 12:34:29,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2024-11-12 12:34:29,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2024-11-12 12:34:29,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2024-11-12 12:34:29,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2024-11-12 12:34:29,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2024-11-12 12:34:29,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2024-11-12 12:34:29,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2024-11-12 12:34:29,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2024-11-12 12:34:29,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:34:29,550 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:34:29,551 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 12:34:29,551 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-12 12:34:29,592 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-12 12:34:29,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 368 transitions, 763 flow [2024-11-12 12:34:29,667 INFO L124 PetriNetUnfolderBase]: 93/766 cut-off events. [2024-11-12 12:34:29,668 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-12 12:34:29,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 766 events. 93/766 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3689 event pairs, 1 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 523. Up to 16 conditions per place. [2024-11-12 12:34:29,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 368 transitions, 763 flow [2024-11-12 12:34:29,679 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 327 places, 368 transitions, 763 flow [2024-11-12 12:34:29,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:34:29,680 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;@6899c80a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:34:29,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-11-12 12:34:29,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:34:29,683 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-11-12 12:34:29,684 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:34:29,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:34:29,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:34:29,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:34:29,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:34:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2081171131, now seen corresponding path program 1 times [2024-11-12 12:34:29,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:34:29,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170051742] [2024-11-12 12:34:29,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:34:29,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:34:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:34:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:34:29,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:34:29,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170051742] [2024-11-12 12:34:29,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170051742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:34:29,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:34:29,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:34:29,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519372939] [2024-11-12 12:34:29,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:34:29,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 12:34:29,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:34:29,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 12:34:29,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 12:34:29,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 368 [2024-11-12 12:34:29,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 368 transitions, 763 flow. Second operand has 2 states, 2 states have (on average 282.5) internal successors, (565), 2 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:29,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:34:29,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 368 [2024-11-12 12:34:29,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:34:40,784 INFO L124 PetriNetUnfolderBase]: 26755/100755 cut-off events. [2024-11-12 12:34:40,784 INFO L125 PetriNetUnfolderBase]: For 1786/1786 co-relation queries the response was YES. [2024-11-12 12:34:41,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137527 conditions, 100755 events. 26755/100755 cut-off events. For 1786/1786 co-relation queries the response was YES. Maximal size of possible extension queue 2181. Compared 1527965 event pairs, 25579 based on Foata normal form. 30050/119562 useless extension candidates. Maximal degree in co-relation 123632. Up to 35952 conditions per place. [2024-11-12 12:34:41,610 INFO L140 encePairwiseOnDemand]: 326/368 looper letters, 41 selfloop transitions, 0 changer transitions 0/318 dead transitions. [2024-11-12 12:34:41,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 318 transitions, 745 flow [2024-11-12 12:34:41,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 12:34:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-12 12:34:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 645 transitions. [2024-11-12 12:34:41,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.876358695652174 [2024-11-12 12:34:41,612 INFO L175 Difference]: Start difference. First operand has 327 places, 368 transitions, 763 flow. Second operand 2 states and 645 transitions. [2024-11-12 12:34:41,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 318 transitions, 745 flow [2024-11-12 12:34:41,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 318 transitions, 745 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:34:41,624 INFO L231 Difference]: Finished difference. Result has 320 places, 318 transitions, 663 flow [2024-11-12 12:34:41,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=663, PETRI_PLACES=320, PETRI_TRANSITIONS=318} [2024-11-12 12:34:41,626 INFO L279 CegarLoopForPetriNet]: 327 programPoint places, -7 predicate places. [2024-11-12 12:34:41,626 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 318 transitions, 663 flow [2024-11-12 12:34:41,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 282.5) internal successors, (565), 2 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:41,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:34:41,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:34:41,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:34:41,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:34:41,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:34:41,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2078320755, now seen corresponding path program 1 times [2024-11-12 12:34:41,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:34:41,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930180126] [2024-11-12 12:34:41,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:34:41,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:34:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:34:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:34:41,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:34:41,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930180126] [2024-11-12 12:34:41,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930180126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:34:41,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:34:41,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:34:41,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728946212] [2024-11-12 12:34:41,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:34:41,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:34:41,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:34:41,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:34:41,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:34:41,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 368 [2024-11-12 12:34:41,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 318 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:34:41,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:34:41,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 368 [2024-11-12 12:34:41,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand