./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.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 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:53:02,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:53:02,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:53:02,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:53:02,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:53:02,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:53:02,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:53:02,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:53:02,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:53:02,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:53:02,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:53:02,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:53:02,208 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:53:02,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:53:02,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:53:02,213 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:53:02,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:53:02,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:53:02,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:53:02,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:53:02,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:53:02,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:53:02,216 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:53:02,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:53:02,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:53:02,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:53:02,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:53:02,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:53:02,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:53:02,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:53:02,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:53:02,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:53:02,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:53:02,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:53:02,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:53:02,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:53:02,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:53:02,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:53:02,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:53:02,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:53:02,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:53:02,222 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 -> 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef [2024-10-13 09:53:02,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:53:02,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:53:02,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:53:02,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:53:02,534 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:53:02,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2024-10-13 09:53:04,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:53:04,327 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:53:04,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2024-10-13 09:53:04,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/719bc6625/d2e76302f0784d15918c0dfe5a52a4ad/FLAG9d811258b [2024-10-13 09:53:04,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/719bc6625/d2e76302f0784d15918c0dfe5a52a4ad [2024-10-13 09:53:04,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:53:04,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:53:04,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:53:04,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:53:04,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:53:04,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:53:04" (1/1) ... [2024-10-13 09:53:04,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43970e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:04, skipping insertion in model container [2024-10-13 09:53:04,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:53:04" (1/1) ... [2024-10-13 09:53:04,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:53:04,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:53:04,950 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:53:05,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:53:05,091 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:53:05,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05 WrapperNode [2024-10-13 09:53:05,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:53:05,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:53:05,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:53:05,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:53:05,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05" (1/1) ... [2024-10-13 09:53:05,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05" (1/1) ... [2024-10-13 09:53:05,152 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 110 [2024-10-13 09:53:05,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:53:05,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:53:05,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:53:05,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:53:05,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05" (1/1) ... [2024-10-13 09:53:05,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05" (1/1) ... [2024-10-13 09:53:05,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05" (1/1) ... [2024-10-13 09:53:05,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05" (1/1) ... [2024-10-13 09:53:05,181 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05" (1/1) ... [2024-10-13 09:53:05,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05" (1/1) ... [2024-10-13 09:53:05,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05" (1/1) ... [2024-10-13 09:53:05,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05" (1/1) ... [2024-10-13 09:53:05,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:53:05,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:53:05,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:53:05,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:53:05,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05" (1/1) ... [2024-10-13 09:53:05,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:53:05,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:53:05,239 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-10-13 09:53:05,246 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-10-13 09:53:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:53:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:53:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 09:53:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 09:53:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 09:53:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 09:53:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:53:05,295 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-13 09:53:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-13 09:53:05,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:53:05,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:53:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:53:05,297 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:53:05,481 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:53:05,485 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:53:05,802 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:53:05,803 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:53:05,838 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:53:05,838 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-13 09:53:05,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:53:05 BoogieIcfgContainer [2024-10-13 09:53:05,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:53:05,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:53:05,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:53:05,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:53:05,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:53:04" (1/3) ... [2024-10-13 09:53:05,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403e2790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:53:05, skipping insertion in model container [2024-10-13 09:53:05,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:05" (2/3) ... [2024-10-13 09:53:05,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403e2790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:53:05, skipping insertion in model container [2024-10-13 09:53:05,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:53:05" (3/3) ... [2024-10-13 09:53:05,848 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_07-cond_racing2.i [2024-10-13 09:53:05,867 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:53:05,867 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-13 09:53:05,868 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:53:05,950 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-13 09:53:05,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 164 transitions, 335 flow [2024-10-13 09:53:06,078 INFO L124 PetriNetUnfolderBase]: 25/233 cut-off events. [2024-10-13 09:53:06,082 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 09:53:06,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 233 events. 25/233 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 688 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 119. Up to 6 conditions per place. [2024-10-13 09:53:06,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 164 transitions, 335 flow [2024-10-13 09:53:06,097 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 164 transitions, 335 flow [2024-10-13 09:53:06,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:53:06,121 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;@424bcb6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:53:06,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-13 09:53:06,136 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:53:06,137 INFO L124 PetriNetUnfolderBase]: 3/63 cut-off events. [2024-10-13 09:53:06,137 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:53:06,137 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:06,138 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:06,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-13 09:53:06,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1619116525, now seen corresponding path program 1 times [2024-10-13 09:53:06,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:06,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941848908] [2024-10-13 09:53:06,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:06,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:07,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:07,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941848908] [2024-10-13 09:53:07,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941848908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:07,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:07,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:53:07,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465072554] [2024-10-13 09:53:07,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:07,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:53:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:07,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:53:07,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:53:07,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 164 [2024-10-13 09:53:07,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 164 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:07,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:07,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 164 [2024-10-13 09:53:07,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:07,607 INFO L124 PetriNetUnfolderBase]: 135/851 cut-off events. [2024-10-13 09:53:07,608 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:53:07,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 851 events. 135/851 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5211 event pairs, 60 based on Foata normal form. 106/852 useless extension candidates. Maximal degree in co-relation 993. Up to 198 conditions per place. [2024-10-13 09:53:07,621 INFO L140 encePairwiseOnDemand]: 146/164 looper letters, 48 selfloop transitions, 5 changer transitions 0/173 dead transitions. [2024-10-13 09:53:07,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 173 transitions, 459 flow [2024-10-13 09:53:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:53:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:53:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2024-10-13 09:53:07,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8292682926829268 [2024-10-13 09:53:07,645 INFO L175 Difference]: Start difference. First operand has 151 places, 164 transitions, 335 flow. Second operand 6 states and 816 transitions. [2024-10-13 09:53:07,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 173 transitions, 459 flow [2024-10-13 09:53:07,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 173 transitions, 459 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:53:07,655 INFO L231 Difference]: Finished difference. Result has 153 places, 149 transitions, 315 flow [2024-10-13 09:53:07,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=153, PETRI_TRANSITIONS=149} [2024-10-13 09:53:07,662 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, 2 predicate places. [2024-10-13 09:53:07,665 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 149 transitions, 315 flow [2024-10-13 09:53:07,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:07,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:07,666 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:07,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:53:07,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-13 09:53:07,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1129970920, now seen corresponding path program 1 times [2024-10-13 09:53:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:07,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297343308] [2024-10-13 09:53:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:07,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:07,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297343308] [2024-10-13 09:53:07,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297343308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:07,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:07,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:53:07,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084583179] [2024-10-13 09:53:07,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:07,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:07,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:07,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:07,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:07,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 164 [2024-10-13 09:53:07,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 149 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:07,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:07,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 164 [2024-10-13 09:53:07,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:07,870 INFO L124 PetriNetUnfolderBase]: 57/589 cut-off events. [2024-10-13 09:53:07,871 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-13 09:53:07,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 589 events. 57/589 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2947 event pairs, 0 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 645. Up to 96 conditions per place. [2024-10-13 09:53:07,875 INFO L140 encePairwiseOnDemand]: 161/164 looper letters, 22 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2024-10-13 09:53:07,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 155 transitions, 375 flow [2024-10-13 09:53:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2024-10-13 09:53:07,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8617886178861789 [2024-10-13 09:53:07,880 INFO L175 Difference]: Start difference. First operand has 153 places, 149 transitions, 315 flow. Second operand 3 states and 424 transitions. [2024-10-13 09:53:07,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 155 transitions, 375 flow [2024-10-13 09:53:07,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 155 transitions, 365 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:53:07,886 INFO L231 Difference]: Finished difference. Result has 151 places, 149 transitions, 313 flow [2024-10-13 09:53:07,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=151, PETRI_TRANSITIONS=149} [2024-10-13 09:53:07,887 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, 0 predicate places. [2024-10-13 09:53:07,887 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 149 transitions, 313 flow [2024-10-13 09:53:07,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:07,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:07,889 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:07,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:53:07,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-13 09:53:07,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:07,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1539110074, now seen corresponding path program 1 times [2024-10-13 09:53:07,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:07,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781645608] [2024-10-13 09:53:07,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:07,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:07,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:07,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781645608] [2024-10-13 09:53:07,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781645608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:07,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:07,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:53:07,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287632041] [2024-10-13 09:53:07,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:07,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:07,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:07,977 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 164 [2024-10-13 09:53:07,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 149 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:07,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:07,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 164 [2024-10-13 09:53:07,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:08,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([485] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of1ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][155], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), 164#true, 160#true, 151#true, 97#L952-9true]) [2024-10-13 09:53:08,121 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2024-10-13 09:53:08,121 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-13 09:53:08,121 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-13 09:53:08,121 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-13 09:53:08,132 INFO L124 PetriNetUnfolderBase]: 134/904 cut-off events. [2024-10-13 09:53:08,132 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-13 09:53:08,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 904 events. 134/904 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5514 event pairs, 32 based on Foata normal form. 0/805 useless extension candidates. Maximal degree in co-relation 1105. Up to 130 conditions per place. [2024-10-13 09:53:08,140 INFO L140 encePairwiseOnDemand]: 155/164 looper letters, 30 selfloop transitions, 6 changer transitions 0/162 dead transitions. [2024-10-13 09:53:08,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 162 transitions, 414 flow [2024-10-13 09:53:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2024-10-13 09:53:08,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8597560975609756 [2024-10-13 09:53:08,142 INFO L175 Difference]: Start difference. First operand has 151 places, 149 transitions, 313 flow. Second operand 3 states and 423 transitions. [2024-10-13 09:53:08,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 162 transitions, 414 flow [2024-10-13 09:53:08,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 162 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:53:08,149 INFO L231 Difference]: Finished difference. Result has 151 places, 151 transitions, 347 flow [2024-10-13 09:53:08,151 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=151, PETRI_TRANSITIONS=151} [2024-10-13 09:53:08,152 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, 0 predicate places. [2024-10-13 09:53:08,152 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 151 transitions, 347 flow [2024-10-13 09:53:08,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:08,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:08,153 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:08,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:53:08,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-13 09:53:08,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1366458292, now seen corresponding path program 1 times [2024-10-13 09:53:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:08,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080756105] [2024-10-13 09:53:08,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080756105] [2024-10-13 09:53:08,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080756105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:08,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:08,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:53:08,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261998673] [2024-10-13 09:53:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:08,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:08,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:08,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:08,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:08,243 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 164 [2024-10-13 09:53:08,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 151 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:08,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:08,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 164 [2024-10-13 09:53:08,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:08,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([485] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of1ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][154], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), 164#true, Black: 166#(= |#race~global~0| 0), 169#true, 151#true, 97#L952-9true]) [2024-10-13 09:53:08,376 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2024-10-13 09:53:08,376 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-13 09:53:08,376 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-13 09:53:08,376 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-13 09:53:08,385 INFO L124 PetriNetUnfolderBase]: 139/986 cut-off events. [2024-10-13 09:53:08,385 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-10-13 09:53:08,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 986 events. 139/986 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6414 event pairs, 50 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 1284. Up to 220 conditions per place. [2024-10-13 09:53:08,393 INFO L140 encePairwiseOnDemand]: 159/164 looper letters, 27 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2024-10-13 09:53:08,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 158 transitions, 427 flow [2024-10-13 09:53:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2024-10-13 09:53:08,395 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8516260162601627 [2024-10-13 09:53:08,395 INFO L175 Difference]: Start difference. First operand has 151 places, 151 transitions, 347 flow. Second operand 3 states and 419 transitions. [2024-10-13 09:53:08,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 158 transitions, 427 flow [2024-10-13 09:53:08,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 158 transitions, 413 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:53:08,402 INFO L231 Difference]: Finished difference. Result has 153 places, 154 transitions, 367 flow [2024-10-13 09:53:08,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=367, PETRI_PLACES=153, PETRI_TRANSITIONS=154} [2024-10-13 09:53:08,404 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, 2 predicate places. [2024-10-13 09:53:08,404 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 154 transitions, 367 flow [2024-10-13 09:53:08,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:08,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:08,405 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:08,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:53:08,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-13 09:53:08,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:08,408 INFO L85 PathProgramCache]: Analyzing trace with hash 260434630, now seen corresponding path program 1 times [2024-10-13 09:53:08,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:08,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775429779] [2024-10-13 09:53:08,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:08,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:53:08,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:53:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:53:08,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:53:08,519 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:53:08,520 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-10-13 09:53:08,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-13 09:53:08,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-13 09:53:08,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-13 09:53:08,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-13 09:53:08,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-13 09:53:08,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-13 09:53:08,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-13 09:53:08,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-13 09:53:08,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-13 09:53:08,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-13 09:53:08,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-13 09:53:08,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:53:08,524 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 09:53:08,527 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 09:53:08,527 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-13 09:53:08,556 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 09:53:08,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 213 transitions, 442 flow [2024-10-13 09:53:08,604 INFO L124 PetriNetUnfolderBase]: 43/379 cut-off events. [2024-10-13 09:53:08,605 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-13 09:53:08,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 379 events. 43/379 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1303 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 235. Up to 9 conditions per place. [2024-10-13 09:53:08,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 213 transitions, 442 flow [2024-10-13 09:53:08,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 213 transitions, 442 flow [2024-10-13 09:53:08,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:53:08,615 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;@424bcb6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:53:08,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-13 09:53:08,622 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:53:08,622 INFO L124 PetriNetUnfolderBase]: 3/63 cut-off events. [2024-10-13 09:53:08,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:53:08,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:08,623 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:08,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:08,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:08,626 INFO L85 PathProgramCache]: Analyzing trace with hash 968015848, now seen corresponding path program 1 times [2024-10-13 09:53:08,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:08,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274106484] [2024-10-13 09:53:08,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:08,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:08,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:08,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274106484] [2024-10-13 09:53:08,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274106484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:08,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:08,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:53:08,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25696529] [2024-10-13 09:53:08,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:08,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:53:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:08,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:53:08,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:53:09,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 213 [2024-10-13 09:53:09,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 213 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:09,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:09,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 213 [2024-10-13 09:53:09,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:10,402 INFO L124 PetriNetUnfolderBase]: 1874/8092 cut-off events. [2024-10-13 09:53:10,403 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-10-13 09:53:10,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11060 conditions, 8092 events. 1874/8092 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 84124 event pairs, 708 based on Foata normal form. 1383/8600 useless extension candidates. Maximal degree in co-relation 3268. Up to 2093 conditions per place. [2024-10-13 09:53:10,468 INFO L140 encePairwiseOnDemand]: 189/213 looper letters, 80 selfloop transitions, 5 changer transitions 0/240 dead transitions. [2024-10-13 09:53:10,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 240 transitions, 666 flow [2024-10-13 09:53:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:53:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:53:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1088 transitions. [2024-10-13 09:53:10,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8513302034428795 [2024-10-13 09:53:10,472 INFO L175 Difference]: Start difference. First operand has 195 places, 213 transitions, 442 flow. Second operand 6 states and 1088 transitions. [2024-10-13 09:53:10,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 240 transitions, 666 flow [2024-10-13 09:53:10,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 240 transitions, 666 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:53:10,477 INFO L231 Difference]: Finished difference. Result has 197 places, 192 transitions, 410 flow [2024-10-13 09:53:10,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=197, PETRI_TRANSITIONS=192} [2024-10-13 09:53:10,478 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, 2 predicate places. [2024-10-13 09:53:10,478 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 192 transitions, 410 flow [2024-10-13 09:53:10,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:10,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:10,479 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:10,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:53:10,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:10,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1681818035, now seen corresponding path program 1 times [2024-10-13 09:53:10,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:10,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402198177] [2024-10-13 09:53:10,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:10,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:10,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:10,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402198177] [2024-10-13 09:53:10,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402198177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:10,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:10,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:53:10,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129000729] [2024-10-13 09:53:10,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:10,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:10,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:10,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:10,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:10,536 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 213 [2024-10-13 09:53:10,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 192 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:10,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:10,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 213 [2024-10-13 09:53:10,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:11,291 INFO L124 PetriNetUnfolderBase]: 972/5006 cut-off events. [2024-10-13 09:53:11,292 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2024-10-13 09:53:11,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6636 conditions, 5006 events. 972/5006 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 48695 event pairs, 327 based on Foata normal form. 1/4470 useless extension candidates. Maximal degree in co-relation 876. Up to 1438 conditions per place. [2024-10-13 09:53:11,335 INFO L140 encePairwiseOnDemand]: 210/213 looper letters, 31 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2024-10-13 09:53:11,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 199 transitions, 492 flow [2024-10-13 09:53:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2024-10-13 09:53:11,338 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8419405320813772 [2024-10-13 09:53:11,338 INFO L175 Difference]: Start difference. First operand has 197 places, 192 transitions, 410 flow. Second operand 3 states and 538 transitions. [2024-10-13 09:53:11,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 199 transitions, 492 flow [2024-10-13 09:53:11,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 199 transitions, 480 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:53:11,343 INFO L231 Difference]: Finished difference. Result has 195 places, 193 transitions, 412 flow [2024-10-13 09:53:11,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=195, PETRI_TRANSITIONS=193} [2024-10-13 09:53:11,344 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, 0 predicate places. [2024-10-13 09:53:11,344 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 193 transitions, 412 flow [2024-10-13 09:53:11,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:11,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:11,345 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:11,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:53:11,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:11,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1104877047, now seen corresponding path program 1 times [2024-10-13 09:53:11,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:11,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382878726] [2024-10-13 09:53:11,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:11,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:11,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:11,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382878726] [2024-10-13 09:53:11,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382878726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:11,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:11,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:53:11,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789955893] [2024-10-13 09:53:11,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:11,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:11,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:11,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:11,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:11,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 213 [2024-10-13 09:53:11,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 193 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:11,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:11,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 213 [2024-10-13 09:53:11,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:12,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 195#true, 193#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:12,346 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2024-10-13 09:53:12,346 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-13 09:53:12,346 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-13 09:53:12,346 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-13 09:53:12,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 51#$Ultimate##0true, 193#true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:12,941 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-13 09:53:12,941 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-13 09:53:12,941 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-13 09:53:12,941 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-13 09:53:12,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 28#$Ultimate##0true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:12,948 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-13 09:53:12,951 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-13 09:53:12,951 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-13 09:53:12,951 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-13 09:53:12,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 122#L938-3true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:12,976 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-13 09:53:12,976 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 09:53:12,977 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-13 09:53:12,977 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 09:53:12,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0), 55#L938-3true]) [2024-10-13 09:53:12,999 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2024-10-13 09:53:13,002 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-13 09:53:13,002 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-13 09:53:13,002 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-13 09:53:13,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 117#L939-3true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,060 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-10-13 09:53:13,060 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:53:13,060 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:53:13,060 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:53:13,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 11#L939-3true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,081 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2024-10-13 09:53:13,081 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-13 09:53:13,081 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-13 09:53:13,082 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-13 09:53:13,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][222], [115#L952-9true, 83#L939-5true, 193#true, 210#(= |#race~global~0| 0), 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,082 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-10-13 09:53:13,082 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-13 09:53:13,082 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-13 09:53:13,082 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:53:13,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][222], [115#L952-9true, 193#true, 141#L939-6true, 210#(= |#race~global~0| 0), 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,129 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-13 09:53:13,129 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-13 09:53:13,129 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:53:13,129 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-13 09:53:13,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 83#L939-5true, 193#true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,130 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is not cut-off event [2024-10-13 09:53:13,130 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-13 09:53:13,130 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-13 09:53:13,130 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-13 09:53:13,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 138#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,130 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-13 09:53:13,130 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-13 09:53:13,131 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:53:13,131 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-13 09:53:13,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 141#L939-6true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,152 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is not cut-off event [2024-10-13 09:53:13,152 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2024-10-13 09:53:13,152 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-10-13 09:53:13,152 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-10-13 09:53:13,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 78#L939-10true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,311 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-13 09:53:13,311 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:53:13,311 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:53:13,311 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-13 09:53:13,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [182#L939-10true, 115#L952-9true, 208#true, 193#true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,333 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is not cut-off event [2024-10-13 09:53:13,333 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-13 09:53:13,333 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2024-10-13 09:53:13,333 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-13 09:53:13,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 148#L939-16true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,392 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-13 09:53:13,393 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:53:13,393 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:13,393 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:13,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 104#L939-16true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,409 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2024-10-13 09:53:13,409 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-13 09:53:13,409 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-13 09:53:13,409 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2024-10-13 09:53:13,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0), 150#L939-22true]) [2024-10-13 09:53:13,443 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-13 09:53:13,443 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-13 09:53:13,444 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:53:13,444 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:53:13,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [17#L939-22true, 115#L952-9true, 208#true, 193#true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,457 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2024-10-13 09:53:13,457 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-13 09:53:13,457 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-13 09:53:13,457 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-13 09:53:13,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][221], [115#L952-9true, 9#L939-24true, 194#true, 195#true, 210#(= |#race~global~0| 0), 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,470 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-13 09:53:13,470 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-13 09:53:13,470 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:53:13,470 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:53:13,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 54#L939-24true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,482 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is not cut-off event [2024-10-13 09:53:13,482 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2024-10-13 09:53:13,482 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2024-10-13 09:53:13,482 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2024-10-13 09:53:13,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 101#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 193#true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,483 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-13 09:53:13,483 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:53:13,483 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-13 09:53:13,483 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-13 09:53:13,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][221], [115#L952-9true, 194#true, 195#true, 210#(= |#race~global~0| 0), 48#L939-25true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,486 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-13 09:53:13,486 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-13 09:53:13,487 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:53:13,487 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-13 09:53:13,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 9#L939-24true, 194#true, 195#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,488 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is not cut-off event [2024-10-13 09:53:13,488 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2024-10-13 09:53:13,488 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2024-10-13 09:53:13,488 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2024-10-13 09:53:13,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 14#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,489 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-13 09:53:13,489 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-13 09:53:13,492 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:53:13,493 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-13 09:53:13,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 110#L939-25true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,501 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is not cut-off event [2024-10-13 09:53:13,501 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is not cut-off event [2024-10-13 09:53:13,502 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-10-13 09:53:13,502 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is not cut-off event [2024-10-13 09:53:13,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 48#L939-25true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,503 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is not cut-off event [2024-10-13 09:53:13,503 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is not cut-off event [2024-10-13 09:53:13,503 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-10-13 09:53:13,503 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is not cut-off event [2024-10-13 09:53:13,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [72#L939-29true, 115#L952-9true, 208#true, 194#true, 195#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,524 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 09:53:13,524 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-10-13 09:53:13,524 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-13 09:53:13,524 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-13 09:53:13,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 12#L939-29true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,539 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-10-13 09:53:13,539 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:53:13,539 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-13 09:53:13,539 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-13 09:53:13,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][222], [115#L952-9true, 193#true, 110#L939-25true, 210#(= |#race~global~0| 0), 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,540 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-13 09:53:13,540 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-13 09:53:13,540 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-13 09:53:13,540 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:53:13,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][222], [115#L952-9true, 193#true, 210#(= |#race~global~0| 0), 54#L939-24true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,540 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-13 09:53:13,540 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:53:13,540 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:53:13,541 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:53:13,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [5#L939-35true, 115#L952-9true, 208#true, 194#true, 195#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,551 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-13 09:53:13,551 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-10-13 09:53:13,551 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 09:53:13,551 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 09:53:13,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 191#L939-35true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,558 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2024-10-13 09:53:13,558 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2024-10-13 09:53:13,558 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2024-10-13 09:53:13,558 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is not cut-off event [2024-10-13 09:53:13,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 161#L940-2true, 194#true, 195#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,570 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-13 09:53:13,570 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-10-13 09:53:13,570 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:53:13,570 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:53:13,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 56#L940-2true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:13,574 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event [2024-10-13 09:53:13,575 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-10-13 09:53:13,575 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is not cut-off event [2024-10-13 09:53:13,575 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-10-13 09:53:13,607 INFO L124 PetriNetUnfolderBase]: 4754/15587 cut-off events. [2024-10-13 09:53:13,608 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2024-10-13 09:53:13,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22967 conditions, 15587 events. 4754/15587 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 174506 event pairs, 1581 based on Foata normal form. 0/13777 useless extension candidates. Maximal degree in co-relation 22903. Up to 3673 conditions per place. [2024-10-13 09:53:13,732 INFO L140 encePairwiseOnDemand]: 194/213 looper letters, 58 selfloop transitions, 14 changer transitions 0/226 dead transitions. [2024-10-13 09:53:13,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 226 transitions, 633 flow [2024-10-13 09:53:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2024-10-13 09:53:13,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8482003129890454 [2024-10-13 09:53:13,735 INFO L175 Difference]: Start difference. First operand has 195 places, 193 transitions, 412 flow. Second operand 3 states and 542 transitions. [2024-10-13 09:53:13,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 226 transitions, 633 flow [2024-10-13 09:53:13,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 226 transitions, 631 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:53:13,741 INFO L231 Difference]: Finished difference. Result has 198 places, 207 transitions, 532 flow [2024-10-13 09:53:13,741 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=198, PETRI_TRANSITIONS=207} [2024-10-13 09:53:13,742 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, 3 predicate places. [2024-10-13 09:53:13,742 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 207 transitions, 532 flow [2024-10-13 09:53:13,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:13,743 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:13,743 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:13,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:53:13,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:13,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash -39313574, now seen corresponding path program 1 times [2024-10-13 09:53:13,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:13,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476844107] [2024-10-13 09:53:13,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:13,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:13,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:13,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476844107] [2024-10-13 09:53:13,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476844107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:13,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:13,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:53:13,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707362983] [2024-10-13 09:53:13,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:13,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:13,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:13,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:13,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:13,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2024-10-13 09:53:13,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 207 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:13,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:13,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2024-10-13 09:53:13,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:14,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 195#true, 193#true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:14,704 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2024-10-13 09:53:14,704 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-13 09:53:14,704 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-13 09:53:14,704 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-13 09:53:15,402 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [51#$Ultimate##0true, 208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,402 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-13 09:53:15,402 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-13 09:53:15,402 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-13 09:53:15,403 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-13 09:53:15,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [208#true, 115#L952-9true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 28#$Ultimate##0true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,407 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-13 09:53:15,407 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-13 09:53:15,408 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-13 09:53:15,408 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-13 09:53:15,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 208#true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 122#L938-3true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,433 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-13 09:53:15,433 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 09:53:15,433 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-13 09:53:15,433 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 09:53:15,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 196#true, 55#L938-3true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,460 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2024-10-13 09:53:15,460 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-13 09:53:15,461 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-13 09:53:15,461 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-13 09:53:15,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [208#true, 115#L952-9true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 213#true, 117#L939-3true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,519 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-10-13 09:53:15,519 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:53:15,519 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:53:15,519 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:53:15,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 11#L939-3true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,686 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2024-10-13 09:53:15,686 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-13 09:53:15,686 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-13 09:53:15,686 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-13 09:53:15,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, Black: 208#true, 83#L939-5true, 193#true, 210#(= |#race~global~0| 0), 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,686 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-10-13 09:53:15,686 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:53:15,686 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-13 09:53:15,686 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-13 09:53:15,724 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 83#L939-5true, 193#true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,725 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is not cut-off event [2024-10-13 09:53:15,725 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-13 09:53:15,725 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-13 09:53:15,725 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-13 09:53:15,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 141#L939-6true, 193#true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,743 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is not cut-off event [2024-10-13 09:53:15,743 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-10-13 09:53:15,743 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-10-13 09:53:15,743 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2024-10-13 09:53:15,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [182#L939-10true, 115#L952-9true, 208#true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,797 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is not cut-off event [2024-10-13 09:53:15,797 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-13 09:53:15,797 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-13 09:53:15,797 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2024-10-13 09:53:15,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 208#true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 77#L939-13true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,819 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-13 09:53:15,819 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-13 09:53:15,819 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:53:15,819 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:53:15,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 208#true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 213#true, 148#L939-16true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,829 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-13 09:53:15,829 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:15,829 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:15,829 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:53:15,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, Black: 210#(= |#race~global~0| 0), 193#true, 104#L939-16true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,838 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2024-10-13 09:53:15,838 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-13 09:53:15,838 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2024-10-13 09:53:15,838 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-13 09:53:15,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 208#true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 213#true, 150#L939-22true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,856 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-13 09:53:15,857 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:53:15,857 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-13 09:53:15,857 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:53:15,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [17#L939-22true, 208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,864 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2024-10-13 09:53:15,864 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-13 09:53:15,864 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-13 09:53:15,864 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-13 09:53:15,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 9#L939-24true, Black: 208#true, 194#true, 195#true, 210#(= |#race~global~0| 0), 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,870 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-13 09:53:15,870 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:53:15,870 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-13 09:53:15,870 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:53:15,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 208#true, 72#L939-29true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,898 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 09:53:15,898 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-13 09:53:15,898 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-13 09:53:15,898 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-10-13 09:53:15,903 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 193#true, 12#L939-29true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,903 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event [2024-10-13 09:53:15,903 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-13 09:53:15,903 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is not cut-off event [2024-10-13 09:53:15,903 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-13 09:53:15,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, Black: 208#true, 193#true, 213#true, 210#(= |#race~global~0| 0), 196#true, 54#L939-24true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,908 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-13 09:53:15,908 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:53:15,908 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:53:15,908 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:53:15,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [5#L939-35true, 208#true, 115#L952-9true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,913 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-13 09:53:15,913 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-10-13 09:53:15,913 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 09:53:15,913 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 09:53:15,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 191#L939-35true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,916 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2024-10-13 09:53:15,916 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2024-10-13 09:53:15,916 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is not cut-off event [2024-10-13 09:53:15,916 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2024-10-13 09:53:15,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 208#true, 194#true, 161#L940-2true, Black: 210#(= |#race~global~0| 0), 195#true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:15,999 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-13 09:53:15,999 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:53:15,999 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-10-13 09:53:15,999 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:53:16,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 56#L940-2true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-13 09:53:16,003 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event [2024-10-13 09:53:16,003 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-10-13 09:53:16,003 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-10-13 09:53:16,003 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is not cut-off event [2024-10-13 09:53:16,026 INFO L124 PetriNetUnfolderBase]: 4902/17958 cut-off events. [2024-10-13 09:53:16,026 INFO L125 PetriNetUnfolderBase]: For 4627/4785 co-relation queries the response was YES. [2024-10-13 09:53:16,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29532 conditions, 17958 events. 4902/17958 cut-off events. For 4627/4785 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 214161 event pairs, 2418 based on Foata normal form. 45/16141 useless extension candidates. Maximal degree in co-relation 28053. Up to 6184 conditions per place. [2024-10-13 09:53:16,153 INFO L140 encePairwiseOnDemand]: 204/213 looper letters, 52 selfloop transitions, 14 changer transitions 0/231 dead transitions. [2024-10-13 09:53:16,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 231 transitions, 750 flow [2024-10-13 09:53:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2024-10-13 09:53:16,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.838810641627543 [2024-10-13 09:53:16,156 INFO L175 Difference]: Start difference. First operand has 198 places, 207 transitions, 532 flow. Second operand 3 states and 536 transitions. [2024-10-13 09:53:16,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 231 transitions, 750 flow [2024-10-13 09:53:16,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 231 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:53:16,171 INFO L231 Difference]: Finished difference. Result has 200 places, 219 transitions, 630 flow [2024-10-13 09:53:16,172 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=200, PETRI_TRANSITIONS=219} [2024-10-13 09:53:16,174 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, 5 predicate places. [2024-10-13 09:53:16,174 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 219 transitions, 630 flow [2024-10-13 09:53:16,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:16,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:16,175 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:16,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:53:16,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:16,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash -733496753, now seen corresponding path program 1 times [2024-10-13 09:53:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:16,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713228684] [2024-10-13 09:53:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:16,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713228684] [2024-10-13 09:53:16,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713228684] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:53:16,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587470678] [2024-10-13 09:53:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:16,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:53:16,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:53:16,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:53:16,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 09:53:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:16,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 09:53:16,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:53:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 09:53:16,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:53:16,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587470678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:16,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:53:16,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-13 09:53:16,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273974036] [2024-10-13 09:53:16,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:16,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:16,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:16,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:16,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:53:16,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 213 [2024-10-13 09:53:16,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 219 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:16,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:16,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 213 [2024-10-13 09:53:16,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:19,179 INFO L124 PetriNetUnfolderBase]: 5834/27521 cut-off events. [2024-10-13 09:53:19,179 INFO L125 PetriNetUnfolderBase]: For 3230/4167 co-relation queries the response was YES. [2024-10-13 09:53:19,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41445 conditions, 27521 events. 5834/27521 cut-off events. For 3230/4167 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 370901 event pairs, 2503 based on Foata normal form. 127/24842 useless extension candidates. Maximal degree in co-relation 39177. Up to 3430 conditions per place. [2024-10-13 09:53:19,384 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 42 selfloop transitions, 3 changer transitions 0/238 dead transitions. [2024-10-13 09:53:19,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 238 transitions, 764 flow [2024-10-13 09:53:19,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2024-10-13 09:53:19,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8607198748043818 [2024-10-13 09:53:19,387 INFO L175 Difference]: Start difference. First operand has 200 places, 219 transitions, 630 flow. Second operand 3 states and 550 transitions. [2024-10-13 09:53:19,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 238 transitions, 764 flow [2024-10-13 09:53:19,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 238 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:53:19,414 INFO L231 Difference]: Finished difference. Result has 202 places, 221 transitions, 624 flow [2024-10-13 09:53:19,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=202, PETRI_TRANSITIONS=221} [2024-10-13 09:53:19,416 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, 7 predicate places. [2024-10-13 09:53:19,417 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 221 transitions, 624 flow [2024-10-13 09:53:19,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:19,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:19,417 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:19,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 09:53:19,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 09:53:19,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:19,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:19,619 INFO L85 PathProgramCache]: Analyzing trace with hash 187245600, now seen corresponding path program 1 times [2024-10-13 09:53:19,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:19,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531629697] [2024-10-13 09:53:19,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:19,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:19,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:19,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531629697] [2024-10-13 09:53:19,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531629697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:53:19,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077669191] [2024-10-13 09:53:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:19,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:53:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:53:19,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:53:19,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 09:53:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:19,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 09:53:19,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:53:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 09:53:20,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:53:20,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077669191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:20,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:53:20,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-13 09:53:20,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037552715] [2024-10-13 09:53:20,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:20,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:20,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:20,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:20,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:53:20,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 213 [2024-10-13 09:53:20,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 221 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:20,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:20,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 213 [2024-10-13 09:53:20,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:23,114 INFO L124 PetriNetUnfolderBase]: 6115/29089 cut-off events. [2024-10-13 09:53:23,114 INFO L125 PetriNetUnfolderBase]: For 5727/6149 co-relation queries the response was YES. [2024-10-13 09:53:23,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44987 conditions, 29089 events. 6115/29089 cut-off events. For 5727/6149 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 391454 event pairs, 3054 based on Foata normal form. 130/25945 useless extension candidates. Maximal degree in co-relation 42646. Up to 6042 conditions per place. [2024-10-13 09:53:23,292 INFO L140 encePairwiseOnDemand]: 210/213 looper letters, 42 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2024-10-13 09:53:23,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 237 transitions, 752 flow [2024-10-13 09:53:23,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2024-10-13 09:53:23,294 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8560250391236307 [2024-10-13 09:53:23,295 INFO L175 Difference]: Start difference. First operand has 202 places, 221 transitions, 624 flow. Second operand 3 states and 547 transitions. [2024-10-13 09:53:23,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 237 transitions, 752 flow [2024-10-13 09:53:23,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 237 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:53:23,319 INFO L231 Difference]: Finished difference. Result has 203 places, 222 transitions, 632 flow [2024-10-13 09:53:23,320 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=203, PETRI_TRANSITIONS=222} [2024-10-13 09:53:23,321 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, 8 predicate places. [2024-10-13 09:53:23,321 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 222 transitions, 632 flow [2024-10-13 09:53:23,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:23,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:23,322 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:23,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 09:53:23,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 09:53:23,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:23,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash -516409989, now seen corresponding path program 1 times [2024-10-13 09:53:23,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:23,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957268347] [2024-10-13 09:53:23,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:23,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:23,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957268347] [2024-10-13 09:53:23,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957268347] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:53:23,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789291340] [2024-10-13 09:53:23,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:23,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:53:23,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:53:23,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:53:23,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 09:53:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:23,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 09:53:23,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:53:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:23,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:53:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:23,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789291340] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:53:23,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:53:23,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-13 09:53:23,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66131410] [2024-10-13 09:53:23,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:53:23,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:53:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:23,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:53:23,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:53:23,946 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 213 [2024-10-13 09:53:23,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 222 transitions, 632 flow. Second operand has 10 states, 10 states have (on average 167.3) internal successors, (1673), 10 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:23,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:23,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 213 [2024-10-13 09:53:23,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:24,456 INFO L124 PetriNetUnfolderBase]: 675/2923 cut-off events. [2024-10-13 09:53:24,456 INFO L125 PetriNetUnfolderBase]: For 224/241 co-relation queries the response was YES. [2024-10-13 09:53:24,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4511 conditions, 2923 events. 675/2923 cut-off events. For 224/241 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 25192 event pairs, 55 based on Foata normal form. 106/2901 useless extension candidates. Maximal degree in co-relation 4501. Up to 458 conditions per place. [2024-10-13 09:53:24,468 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 72 selfloop transitions, 7 changer transitions 0/216 dead transitions. [2024-10-13 09:53:24,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 216 transitions, 716 flow [2024-10-13 09:53:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 09:53:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 09:53:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1566 transitions. [2024-10-13 09:53:24,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8169014084507042 [2024-10-13 09:53:24,473 INFO L175 Difference]: Start difference. First operand has 203 places, 222 transitions, 632 flow. Second operand 9 states and 1566 transitions. [2024-10-13 09:53:24,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 216 transitions, 716 flow [2024-10-13 09:53:24,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 216 transitions, 716 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:53:24,478 INFO L231 Difference]: Finished difference. Result has 159 places, 160 transitions, 460 flow [2024-10-13 09:53:24,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=460, PETRI_PLACES=159, PETRI_TRANSITIONS=160} [2024-10-13 09:53:24,480 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, -36 predicate places. [2024-10-13 09:53:24,481 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 160 transitions, 460 flow [2024-10-13 09:53:24,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 167.3) internal successors, (1673), 10 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:24,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:24,482 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:24,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 09:53:24,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:53:24,687 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:24,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1296148194, now seen corresponding path program 1 times [2024-10-13 09:53:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:24,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228110811] [2024-10-13 09:53:24,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:24,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 09:53:24,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:24,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228110811] [2024-10-13 09:53:24,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228110811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:24,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:24,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:53:24,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934518853] [2024-10-13 09:53:24,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:24,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:24,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:24,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:24,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:24,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2024-10-13 09:53:24,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 160 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:24,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:24,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2024-10-13 09:53:24,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:24,945 INFO L124 PetriNetUnfolderBase]: 260/1301 cut-off events. [2024-10-13 09:53:24,945 INFO L125 PetriNetUnfolderBase]: For 454/475 co-relation queries the response was YES. [2024-10-13 09:53:24,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2349 conditions, 1301 events. 260/1301 cut-off events. For 454/475 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8700 event pairs, 132 based on Foata normal form. 7/1216 useless extension candidates. Maximal degree in co-relation 2338. Up to 459 conditions per place. [2024-10-13 09:53:24,955 INFO L140 encePairwiseOnDemand]: 205/213 looper letters, 42 selfloop transitions, 12 changer transitions 0/174 dead transitions. [2024-10-13 09:53:24,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 174 transitions, 612 flow [2024-10-13 09:53:24,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2024-10-13 09:53:24,957 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8169014084507042 [2024-10-13 09:53:24,957 INFO L175 Difference]: Start difference. First operand has 159 places, 160 transitions, 460 flow. Second operand 3 states and 522 transitions. [2024-10-13 09:53:24,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 174 transitions, 612 flow [2024-10-13 09:53:24,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 174 transitions, 597 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-13 09:53:24,962 INFO L231 Difference]: Finished difference. Result has 158 places, 168 transitions, 543 flow [2024-10-13 09:53:24,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=158, PETRI_TRANSITIONS=168} [2024-10-13 09:53:24,963 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, -37 predicate places. [2024-10-13 09:53:24,963 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 168 transitions, 543 flow [2024-10-13 09:53:24,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:24,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:24,964 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:24,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:53:24,964 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:24,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:24,965 INFO L85 PathProgramCache]: Analyzing trace with hash -34473496, now seen corresponding path program 1 times [2024-10-13 09:53:24,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:24,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737958511] [2024-10-13 09:53:24,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:24,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:24,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:24,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737958511] [2024-10-13 09:53:24,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737958511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:25,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:25,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:53:25,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071103599] [2024-10-13 09:53:25,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:25,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:25,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:25,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:25,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:25,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2024-10-13 09:53:25,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 168 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:25,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:25,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2024-10-13 09:53:25,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:25,219 INFO L124 PetriNetUnfolderBase]: 291/1373 cut-off events. [2024-10-13 09:53:25,219 INFO L125 PetriNetUnfolderBase]: For 1105/1140 co-relation queries the response was YES. [2024-10-13 09:53:25,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2803 conditions, 1373 events. 291/1373 cut-off events. For 1105/1140 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9360 event pairs, 134 based on Foata normal form. 9/1306 useless extension candidates. Maximal degree in co-relation 2792. Up to 501 conditions per place. [2024-10-13 09:53:25,231 INFO L140 encePairwiseOnDemand]: 205/213 looper letters, 49 selfloop transitions, 12 changer transitions 0/183 dead transitions. [2024-10-13 09:53:25,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 183 transitions, 732 flow [2024-10-13 09:53:25,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2024-10-13 09:53:25,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8184663536776213 [2024-10-13 09:53:25,233 INFO L175 Difference]: Start difference. First operand has 158 places, 168 transitions, 543 flow. Second operand 3 states and 523 transitions. [2024-10-13 09:53:25,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 183 transitions, 732 flow [2024-10-13 09:53:25,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 183 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:53:25,238 INFO L231 Difference]: Finished difference. Result has 160 places, 176 transitions, 629 flow [2024-10-13 09:53:25,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=160, PETRI_TRANSITIONS=176} [2024-10-13 09:53:25,239 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, -35 predicate places. [2024-10-13 09:53:25,239 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 176 transitions, 629 flow [2024-10-13 09:53:25,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:25,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:25,240 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:25,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:53:25,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:25,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1588779371, now seen corresponding path program 1 times [2024-10-13 09:53:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:25,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161107848] [2024-10-13 09:53:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:53:25,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:53:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:53:25,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:53:25,285 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:53:25,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-10-13 09:53:25,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-10-13 09:53:25,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-10-13 09:53:25,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-10-13 09:53:25,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-10-13 09:53:25,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-10-13 09:53:25,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-10-13 09:53:25,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-10-13 09:53:25,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-10-13 09:53:25,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-10-13 09:53:25,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-10-13 09:53:25,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-10-13 09:53:25,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-10-13 09:53:25,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-10-13 09:53:25,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-10-13 09:53:25,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-10-13 09:53:25,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:53:25,288 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:25,289 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 09:53:25,289 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-13 09:53:25,316 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 09:53:25,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 262 transitions, 551 flow [2024-10-13 09:53:25,382 INFO L124 PetriNetUnfolderBase]: 66/570 cut-off events. [2024-10-13 09:53:25,382 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-13 09:53:25,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 570 events. 66/570 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2142 event pairs, 1 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 387. Up to 16 conditions per place. [2024-10-13 09:53:25,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 262 transitions, 551 flow [2024-10-13 09:53:25,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 262 transitions, 551 flow [2024-10-13 09:53:25,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:53:25,398 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;@424bcb6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:53:25,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-13 09:53:25,403 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:53:25,403 INFO L124 PetriNetUnfolderBase]: 3/63 cut-off events. [2024-10-13 09:53:25,403 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:53:25,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:25,404 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:25,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-13 09:53:25,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:25,404 INFO L85 PathProgramCache]: Analyzing trace with hash 298954478, now seen corresponding path program 1 times [2024-10-13 09:53:25,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:25,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811565488] [2024-10-13 09:53:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:25,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:25,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:25,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811565488] [2024-10-13 09:53:25,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811565488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:25,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:25,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:53:25,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788399408] [2024-10-13 09:53:25,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:25,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:53:25,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:25,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:53:25,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:53:25,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 262 [2024-10-13 09:53:25,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 262 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 192.5) internal successors, (1155), 6 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:25,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:25,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 262 [2024-10-13 09:53:25,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:31,688 INFO L124 PetriNetUnfolderBase]: 18812/51168 cut-off events. [2024-10-13 09:53:31,688 INFO L125 PetriNetUnfolderBase]: For 1003/1003 co-relation queries the response was YES. [2024-10-13 09:53:31,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77581 conditions, 51168 events. 18812/51168 cut-off events. For 1003/1003 co-relation queries the response was YES. Maximal size of possible extension queue 1339. Compared 631903 event pairs, 2581 based on Foata normal form. 14007/60707 useless extension candidates. Maximal degree in co-relation 8850. Up to 18109 conditions per place. [2024-10-13 09:53:31,988 INFO L140 encePairwiseOnDemand]: 232/262 looper letters, 112 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2024-10-13 09:53:31,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 307 transitions, 875 flow [2024-10-13 09:53:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:53:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:53:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1360 transitions. [2024-10-13 09:53:31,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8651399491094147 [2024-10-13 09:53:31,992 INFO L175 Difference]: Start difference. First operand has 239 places, 262 transitions, 551 flow. Second operand 6 states and 1360 transitions. [2024-10-13 09:53:31,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 307 transitions, 875 flow [2024-10-13 09:53:31,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 307 transitions, 875 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:53:31,996 INFO L231 Difference]: Finished difference. Result has 241 places, 235 transitions, 507 flow [2024-10-13 09:53:31,997 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=241, PETRI_TRANSITIONS=235} [2024-10-13 09:53:31,997 INFO L277 CegarLoopForPetriNet]: 239 programPoint places, 2 predicate places. [2024-10-13 09:53:31,998 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 235 transitions, 507 flow [2024-10-13 09:53:31,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.5) internal successors, (1155), 6 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:31,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:31,998 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:31,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:53:31,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-13 09:53:31,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash -404691821, now seen corresponding path program 1 times [2024-10-13 09:53:31,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:31,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816009107] [2024-10-13 09:53:31,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:31,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:32,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:32,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816009107] [2024-10-13 09:53:32,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816009107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:32,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:32,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:53:32,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500485803] [2024-10-13 09:53:32,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:32,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:32,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:32,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:32,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:32,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 262 [2024-10-13 09:53:32,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 235 transitions, 507 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:32,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:32,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 262 [2024-10-13 09:53:32,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:36,484 INFO L124 PetriNetUnfolderBase]: 10694/37984 cut-off events. [2024-10-13 09:53:36,485 INFO L125 PetriNetUnfolderBase]: For 2242/2242 co-relation queries the response was YES. [2024-10-13 09:53:36,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53572 conditions, 37984 events. 10694/37984 cut-off events. For 2242/2242 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 488681 event pairs, 8202 based on Foata normal form. 1/34087 useless extension candidates. Maximal degree in co-relation 39383. Up to 14422 conditions per place. [2024-10-13 09:53:37,034 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 39 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2024-10-13 09:53:37,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 242 transitions, 605 flow [2024-10-13 09:53:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2024-10-13 09:53:37,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8282442748091603 [2024-10-13 09:53:37,037 INFO L175 Difference]: Start difference. First operand has 241 places, 235 transitions, 507 flow. Second operand 3 states and 651 transitions. [2024-10-13 09:53:37,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 242 transitions, 605 flow [2024-10-13 09:53:37,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 242 transitions, 593 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:53:37,046 INFO L231 Difference]: Finished difference. Result has 239 places, 236 transitions, 509 flow [2024-10-13 09:53:37,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=239, PETRI_TRANSITIONS=236} [2024-10-13 09:53:37,047 INFO L277 CegarLoopForPetriNet]: 239 programPoint places, 0 predicate places. [2024-10-13 09:53:37,047 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 236 transitions, 509 flow [2024-10-13 09:53:37,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:37,048 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:37,048 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:37,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:53:37,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-13 09:53:37,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:37,049 INFO L85 PathProgramCache]: Analyzing trace with hash -507547656, now seen corresponding path program 1 times [2024-10-13 09:53:37,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:37,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709960862] [2024-10-13 09:53:37,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:37,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:37,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:37,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709960862] [2024-10-13 09:53:37,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709960862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:37,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:37,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:53:37,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359801048] [2024-10-13 09:53:37,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:37,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:37,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:37,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:37,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:37,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 262 [2024-10-13 09:53:37,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 236 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:37,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:37,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 262 [2024-10-13 09:53:37,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:38,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 193#L952-9true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true, 237#true]) [2024-10-13 09:53:38,697 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2024-10-13 09:53:38,697 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-13 09:53:38,698 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-13 09:53:38,698 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-13 09:53:42,890 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [111#$Ultimate##0true, 248#true, 235#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true]) [2024-10-13 09:53:42,890 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-13 09:53:42,890 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-13 09:53:42,890 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-13 09:53:42,890 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-13 09:53:42,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 239#true, 142#L938-3true]) [2024-10-13 09:53:42,891 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-10-13 09:53:42,891 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-13 09:53:42,891 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 09:53:42,891 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 09:53:42,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 193#L952-9true, 236#true, 67#$Ultimate##0true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true, 237#true]) [2024-10-13 09:53:42,895 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-13 09:53:42,895 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-13 09:53:42,895 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-13 09:53:42,895 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-13 09:53:43,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 193#L952-9true, 236#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 71#L938-3true, 239#true, 252#true, 237#true]) [2024-10-13 09:53:43,168 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-13 09:53:43,169 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 09:53:43,169 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 09:53:43,169 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-13 09:53:44,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 193#L952-9true, 6#L939-3true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 239#true]) [2024-10-13 09:53:44,787 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-10-13 09:53:44,787 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:53:44,787 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:53:44,787 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:53:44,790 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 193#L952-9true, 236#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true, 95#L939-3true, 237#true]) [2024-10-13 09:53:44,791 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-10-13 09:53:44,791 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:53:44,791 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:53:44,791 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:53:45,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][262], [248#true, 235#true, 193#L952-9true, 129#L939-5true, 238#true, 254#(= |#race~global~0| 0), Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true]) [2024-10-13 09:53:45,909 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-10-13 09:53:45,909 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-13 09:53:45,909 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-13 09:53:45,909 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:53:46,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][262], [65#L939-6true, 248#true, 235#true, 193#L952-9true, 238#true, 254#(= |#race~global~0| 0), Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true]) [2024-10-13 09:53:46,643 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-13 09:53:46,643 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-13 09:53:46,643 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:53:46,643 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-13 09:53:46,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 193#L952-9true, 129#L939-5true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true]) [2024-10-13 09:53:46,643 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is not cut-off event [2024-10-13 09:53:46,643 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-13 09:53:46,643 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-13 09:53:46,643 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-13 09:53:46,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [17#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#true, 235#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true]) [2024-10-13 09:53:46,645 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-13 09:53:46,645 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-13 09:53:46,645 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-13 09:53:46,645 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:53:47,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [65#L939-6true, 248#true, 235#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true]) [2024-10-13 09:53:47,041 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is not cut-off event [2024-10-13 09:53:47,041 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-10-13 09:53:47,041 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-10-13 09:53:47,041 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2024-10-13 09:53:48,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [177#L939-10true, 248#true, 235#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true]) [2024-10-13 09:53:48,669 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-13 09:53:48,669 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-13 09:53:48,669 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:53:48,669 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:53:49,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [115#L939-10true, 248#true, 193#L952-9true, 236#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true, 237#true]) [2024-10-13 09:53:49,606 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is not cut-off event [2024-10-13 09:53:49,606 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2024-10-13 09:53:49,606 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-13 09:53:49,606 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-13 09:53:50,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [111#$Ultimate##0true, 248#true, 235#true, 240#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 55#$Ultimate##0true]) [2024-10-13 09:53:50,843 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-13 09:53:50,843 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-13 09:53:50,843 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-13 09:53:50,843 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-13 09:53:50,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 240#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 142#L938-3true, 55#$Ultimate##0true]) [2024-10-13 09:53:50,844 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-13 09:53:50,844 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:53:50,844 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:50,844 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:50,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [111#$Ultimate##0true, 248#true, 235#true, 240#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 163#L938-3true]) [2024-10-13 09:53:50,844 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-13 09:53:50,844 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:53:50,844 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:50,844 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:51,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 240#true, 193#L952-9true, 236#true, 67#$Ultimate##0true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 237#true, 55#$Ultimate##0true]) [2024-10-13 09:53:51,091 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-13 09:53:51,091 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-13 09:53:51,091 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-13 09:53:51,091 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-13 09:53:51,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 240#true, 193#L952-9true, 236#true, 67#$Ultimate##0true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 237#true, 163#L938-3true]) [2024-10-13 09:53:51,091 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-13 09:53:51,091 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:51,091 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:51,092 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:53:51,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1058] t_funEXIT-->L952-9: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][281], [111#$Ultimate##0true, 248#true, 193#L952-9true, 236#true, 67#$Ultimate##0true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 239#true, 252#true]) [2024-10-13 09:53:51,092 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-13 09:53:51,092 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-13 09:53:51,092 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-13 09:53:51,092 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-13 09:53:51,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1058] t_funEXIT-->L952-9: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][281], [248#true, 193#L952-9true, 236#true, 67#$Ultimate##0true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 239#true, 252#true, 142#L938-3true]) [2024-10-13 09:53:51,092 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-13 09:53:51,093 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:51,093 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:53:51,093 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:51,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 240#true, 193#L952-9true, 236#true, 71#L938-3true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 237#true, 55#$Ultimate##0true]) [2024-10-13 09:53:51,452 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-10-13 09:53:51,452 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:53:51,452 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:51,452 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:51,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1058] t_funEXIT-->L952-9: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][281], [111#$Ultimate##0true, 248#true, 193#L952-9true, 236#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 71#L938-3true, 238#true, 239#true, 252#true]) [2024-10-13 09:53:51,462 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-10-13 09:53:51,462 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:51,462 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:53:51,463 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:51,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 193#L952-9true, 49#L939-16true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true]) [2024-10-13 09:53:51,542 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-13 09:53:51,542 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:51,542 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 09:53:51,542 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:53:51,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 240#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 142#L938-3true, 163#L938-3true]) [2024-10-13 09:53:51,765 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-13 09:53:51,765 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-13 09:53:51,765 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-13 09:53:51,765 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 09:53:52,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 240#true, 193#L952-9true, 236#true, 71#L938-3true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 237#true, 163#L938-3true]) [2024-10-13 09:53:52,267 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-13 09:53:52,267 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-13 09:53:52,267 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-13 09:53:52,267 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 09:53:52,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1058] t_funEXIT-->L952-9: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][281], [248#true, 193#L952-9true, 236#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 71#L938-3true, 238#true, 239#true, 252#true, 142#L938-3true]) [2024-10-13 09:53:52,268 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-13 09:53:52,268 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-13 09:53:52,268 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-13 09:53:52,268 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 09:53:52,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 101#L939-16true, 193#L952-9true, 236#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true, 237#true]) [2024-10-13 09:53:52,343 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2024-10-13 09:53:52,343 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-13 09:53:52,343 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-13 09:53:52,343 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2024-10-13 09:53:53,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 240#true, 193#L952-9true, 6#L939-3true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 55#$Ultimate##0true]) [2024-10-13 09:53:53,083 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-13 09:53:53,083 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:53:53,083 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:53:53,083 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-13 09:53:53,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 240#true, 193#L952-9true, 6#L939-3true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 163#L938-3true]) [2024-10-13 09:53:53,084 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-13 09:53:53,084 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:53:53,084 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 09:53:53,084 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-13 09:53:53,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [111#$Ultimate##0true, 248#true, 235#true, 240#true, 193#L952-9true, 162#L939-3true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true]) [2024-10-13 09:53:53,084 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-13 09:53:53,084 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:53:53,085 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:53:53,085 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event