./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:33:18,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:33:18,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:33:18,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:33:18,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:33:18,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:33:18,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:33:18,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:33:18,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:33:18,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:33:18,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:33:18,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:33:18,952 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:33:18,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:33:18,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:33:18,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:33:18,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:33:18,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:33:18,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:33:18,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:33:18,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:33:18,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:33:18,958 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:33:18,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:33:18,958 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:33:18,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:33:18,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:33:18,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:33:18,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:33:18,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:33:18,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:33:18,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:33:18,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:33:18,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:33:18,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:33:18,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:33:18,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:33:18,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:33:18,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:33:18,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:33:18,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:33:18,961 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 -> 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f [2024-11-12 12:33:19,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:33:19,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:33:19,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:33:19,189 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:33:19,189 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:33:19,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2024-11-12 12:33:20,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:33:20,591 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:33:20,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2024-11-12 12:33:20,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3328336a6/8ac548f789c045f29c0b870df472cdf8/FLAG18e3f39cd [2024-11-12 12:33:20,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3328336a6/8ac548f789c045f29c0b870df472cdf8 [2024-11-12 12:33:20,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:33:20,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:33:20,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:33:20,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:33:20,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:33:20,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:33:20" (1/1) ... [2024-11-12 12:33:20,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c28226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:20, skipping insertion in model container [2024-11-12 12:33:20,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:33:20" (1/1) ... [2024-11-12 12:33:20,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:33:20,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:33:21,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:33:21,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:33:21,115 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:33:21,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21 WrapperNode [2024-11-12 12:33:21,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:33:21,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:33:21,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:33:21,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:33:21,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21" (1/1) ... [2024-11-12 12:33:21,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21" (1/1) ... [2024-11-12 12:33:21,174 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 222 [2024-11-12 12:33:21,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:33:21,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:33:21,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:33:21,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:33:21,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21" (1/1) ... [2024-11-12 12:33:21,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21" (1/1) ... [2024-11-12 12:33:21,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21" (1/1) ... [2024-11-12 12:33:21,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21" (1/1) ... [2024-11-12 12:33:21,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21" (1/1) ... [2024-11-12 12:33:21,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21" (1/1) ... [2024-11-12 12:33:21,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21" (1/1) ... [2024-11-12 12:33:21,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21" (1/1) ... [2024-11-12 12:33:21,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:33:21,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:33:21,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:33:21,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:33:21,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21" (1/1) ... [2024-11-12 12:33:21,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:33:21,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:33:21,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:33:21,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-11-12 12:33:21,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:33:21,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:33:21,278 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 12:33:21,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:33:21,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 12:33:21,278 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-12 12:33:21,278 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-12 12:33:21,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:33:21,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:33:21,279 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 12:33:21,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:33:21,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:33:21,280 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:33:21,385 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:33:21,386 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:33:21,622 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:33:21,623 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:33:21,656 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:33:21,657 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-12 12:33:21,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:33:21 BoogieIcfgContainer [2024-11-12 12:33:21,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:33:21,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:33:21,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:33:21,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:33:21,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:33:20" (1/3) ... [2024-11-12 12:33:21,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7f27df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:33:21, skipping insertion in model container [2024-11-12 12:33:21,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:33:21" (2/3) ... [2024-11-12 12:33:21,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7f27df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:33:21, skipping insertion in model container [2024-11-12 12:33:21,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:33:21" (3/3) ... [2024-11-12 12:33:21,665 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_20-callback_racefree.i [2024-11-12 12:33:21,678 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:33:21,679 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-12 12:33:21,679 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:33:21,733 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-12 12:33:21,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 231 transitions, 469 flow [2024-11-12 12:33:21,860 INFO L124 PetriNetUnfolderBase]: 27/341 cut-off events. [2024-11-12 12:33:21,860 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:33:21,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 341 events. 27/341 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 965 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 192. Up to 6 conditions per place. [2024-11-12 12:33:21,868 INFO L82 GeneralOperation]: Start removeDead. Operand has 218 places, 231 transitions, 469 flow [2024-11-12 12:33:21,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 218 places, 231 transitions, 469 flow [2024-11-12 12:33:21,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:33:21,886 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;@50d6930d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:33:21,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-12 12:33:21,908 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:33:21,908 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2024-11-12 12:33:21,908 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:33:21,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:21,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:21,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-12 12:33:21,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1738818234, now seen corresponding path program 1 times [2024-11-12 12:33:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:21,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512917660] [2024-11-12 12:33:21,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:21,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:22,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:22,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512917660] [2024-11-12 12:33:22,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512917660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:22,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:22,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:33:22,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877495084] [2024-11-12 12:33:22,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:22,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:33:22,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:22,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:33:22,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:33:22,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 231 [2024-11-12 12:33:22,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 231 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:22,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:22,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 231 [2024-11-12 12:33:22,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:23,128 INFO L124 PetriNetUnfolderBase]: 93/831 cut-off events. [2024-11-12 12:33:23,129 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 12:33:23,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 831 events. 93/831 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4394 event pairs, 33 based on Foata normal form. 101/872 useless extension candidates. Maximal degree in co-relation 826. Up to 154 conditions per place. [2024-11-12 12:33:23,135 INFO L140 encePairwiseOnDemand]: 212/231 looper letters, 40 selfloop transitions, 5 changer transitions 0/231 dead transitions. [2024-11-12 12:33:23,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 231 transitions, 559 flow [2024-11-12 12:33:23,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:33:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:33:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2024-11-12 12:33:23,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8636363636363636 [2024-11-12 12:33:23,154 INFO L175 Difference]: Start difference. First operand has 218 places, 231 transitions, 469 flow. Second operand 6 states and 1197 transitions. [2024-11-12 12:33:23,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 231 transitions, 559 flow [2024-11-12 12:33:23,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 231 transitions, 559 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:33:23,163 INFO L231 Difference]: Finished difference. Result has 220 places, 215 transitions, 447 flow [2024-11-12 12:33:23,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=220, PETRI_TRANSITIONS=215} [2024-11-12 12:33:23,170 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, 2 predicate places. [2024-11-12 12:33:23,170 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 215 transitions, 447 flow [2024-11-12 12:33:23,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:23,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:23,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:23,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:33:23,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-12 12:33:23,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash -385128991, now seen corresponding path program 1 times [2024-11-12 12:33:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:23,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068713115] [2024-11-12 12:33:23,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:23,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:23,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:23,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068713115] [2024-11-12 12:33:23,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068713115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:23,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:23,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:33:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520170474] [2024-11-12 12:33:23,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:23,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:23,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:23,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 231 [2024-11-12 12:33:23,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 215 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:23,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:23,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 231 [2024-11-12 12:33:23,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:23,387 INFO L124 PetriNetUnfolderBase]: 113/976 cut-off events. [2024-11-12 12:33:23,387 INFO L125 PetriNetUnfolderBase]: For 13/19 co-relation queries the response was YES. [2024-11-12 12:33:23,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 976 events. 113/976 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4857 event pairs, 34 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 1029. Up to 137 conditions per place. [2024-11-12 12:33:23,394 INFO L140 encePairwiseOnDemand]: 222/231 looper letters, 30 selfloop transitions, 6 changer transitions 0/228 dead transitions. [2024-11-12 12:33:23,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 228 transitions, 548 flow [2024-11-12 12:33:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 621 transitions. [2024-11-12 12:33:23,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8961038961038961 [2024-11-12 12:33:23,396 INFO L175 Difference]: Start difference. First operand has 220 places, 215 transitions, 447 flow. Second operand 3 states and 621 transitions. [2024-11-12 12:33:23,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 228 transitions, 548 flow [2024-11-12 12:33:23,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 228 transitions, 538 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:33:23,402 INFO L231 Difference]: Finished difference. Result has 217 places, 217 transitions, 475 flow [2024-11-12 12:33:23,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=475, PETRI_PLACES=217, PETRI_TRANSITIONS=217} [2024-11-12 12:33:23,404 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -1 predicate places. [2024-11-12 12:33:23,405 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 217 transitions, 475 flow [2024-11-12 12:33:23,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:23,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:23,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:23,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:33:23,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-12 12:33:23,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash 442208826, now seen corresponding path program 1 times [2024-11-12 12:33:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099690817] [2024-11-12 12:33:23,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:23,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:23,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:23,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099690817] [2024-11-12 12:33:23,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099690817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:23,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:23,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:33:23,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275278018] [2024-11-12 12:33:23,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:23,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:23,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:23,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:23,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:23,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 231 [2024-11-12 12:33:23,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 217 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:23,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:23,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 231 [2024-11-12 12:33:23,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:23,630 INFO L124 PetriNetUnfolderBase]: 86/1080 cut-off events. [2024-11-12 12:33:23,631 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-12 12:33:23,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 1080 events. 86/1080 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5630 event pairs, 10 based on Foata normal form. 1/1010 useless extension candidates. Maximal degree in co-relation 1175. Up to 144 conditions per place. [2024-11-12 12:33:23,635 INFO L140 encePairwiseOnDemand]: 228/231 looper letters, 20 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2024-11-12 12:33:23,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 221 transitions, 527 flow [2024-11-12 12:33:23,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2024-11-12 12:33:23,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8946608946608947 [2024-11-12 12:33:23,637 INFO L175 Difference]: Start difference. First operand has 217 places, 217 transitions, 475 flow. Second operand 3 states and 620 transitions. [2024-11-12 12:33:23,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 221 transitions, 527 flow [2024-11-12 12:33:23,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 221 transitions, 515 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:33:23,640 INFO L231 Difference]: Finished difference. Result has 218 places, 217 transitions, 471 flow [2024-11-12 12:33:23,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=218, PETRI_TRANSITIONS=217} [2024-11-12 12:33:23,641 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, 0 predicate places. [2024-11-12 12:33:23,641 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 217 transitions, 471 flow [2024-11-12 12:33:23,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:23,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:23,642 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:23,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:33:23,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-12 12:33:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1971312654, now seen corresponding path program 1 times [2024-11-12 12:33:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:23,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621708914] [2024-11-12 12:33:23,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:33:23,670 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:33:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:33:23,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:33:23,714 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:33:23,715 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-12 12:33:23,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-12 12:33:23,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-12 12:33:23,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-12 12:33:23,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-12 12:33:23,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-12 12:33:23,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-12 12:33:23,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-12 12:33:23,719 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-12 12:33:23,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:33:23,720 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 12:33:23,721 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 12:33:23,721 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-12 12:33:23,744 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 12:33:23,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 263 transitions, 542 flow [2024-11-12 12:33:23,783 INFO L124 PetriNetUnfolderBase]: 45/511 cut-off events. [2024-11-12 12:33:23,784 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:33:23,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 511 events. 45/511 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1846 event pairs, 0 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 343. Up to 9 conditions per place. [2024-11-12 12:33:23,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 263 transitions, 542 flow [2024-11-12 12:33:23,789 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 263 transitions, 542 flow [2024-11-12 12:33:23,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:33:23,791 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;@50d6930d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:33:23,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-12 12:33:23,797 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:33:23,797 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2024-11-12 12:33:23,797 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:33:23,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:23,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:23,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-12 12:33:23,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:23,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1874739962, now seen corresponding path program 1 times [2024-11-12 12:33:23,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:23,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16260318] [2024-11-12 12:33:23,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:23,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:24,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:24,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16260318] [2024-11-12 12:33:24,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16260318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:24,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:24,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:33:24,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440720109] [2024-11-12 12:33:24,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:24,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:33:24,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:24,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:33:24,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:33:24,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 263 [2024-11-12 12:33:24,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 263 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:24,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:24,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 263 [2024-11-12 12:33:24,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:24,660 INFO L124 PetriNetUnfolderBase]: 1001/4650 cut-off events. [2024-11-12 12:33:24,660 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-12 12:33:24,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6309 conditions, 4650 events. 1001/4650 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 43045 event pairs, 108 based on Foata normal form. 915/5232 useless extension candidates. Maximal degree in co-relation 1068. Up to 1202 conditions per place. [2024-11-12 12:33:24,683 INFO L140 encePairwiseOnDemand]: 240/263 looper letters, 62 selfloop transitions, 5 changer transitions 0/273 dead transitions. [2024-11-12 12:33:24,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 273 transitions, 696 flow [2024-11-12 12:33:24,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:33:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:33:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1365 transitions. [2024-11-12 12:33:24,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8650190114068441 [2024-11-12 12:33:24,685 INFO L175 Difference]: Start difference. First operand has 247 places, 263 transitions, 542 flow. Second operand 6 states and 1365 transitions. [2024-11-12 12:33:24,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 273 transitions, 696 flow [2024-11-12 12:33:24,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 273 transitions, 696 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:33:24,728 INFO L231 Difference]: Finished difference. Result has 247 places, 241 transitions, 508 flow [2024-11-12 12:33:24,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=247, PETRI_TRANSITIONS=241} [2024-11-12 12:33:24,729 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 0 predicate places. [2024-11-12 12:33:24,729 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 241 transitions, 508 flow [2024-11-12 12:33:24,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:24,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:24,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:24,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:33:24,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-12 12:33:24,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1430297539, now seen corresponding path program 1 times [2024-11-12 12:33:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:24,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883707002] [2024-11-12 12:33:24,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:24,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:24,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:24,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883707002] [2024-11-12 12:33:24,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883707002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:24,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:24,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:33:24,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814974287] [2024-11-12 12:33:24,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:24,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:24,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:24,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:24,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:24,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 263 [2024-11-12 12:33:24,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 241 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:24,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:24,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 263 [2024-11-12 12:33:24,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:25,630 INFO L124 PetriNetUnfolderBase]: 2103/8752 cut-off events. [2024-11-12 12:33:25,631 INFO L125 PetriNetUnfolderBase]: For 271/398 co-relation queries the response was YES. [2024-11-12 12:33:25,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12276 conditions, 8752 events. 2103/8752 cut-off events. For 271/398 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 86428 event pairs, 747 based on Foata normal form. 8/7949 useless extension candidates. Maximal degree in co-relation 10983. Up to 2127 conditions per place. [2024-11-12 12:33:25,670 INFO L140 encePairwiseOnDemand]: 251/263 looper letters, 45 selfloop transitions, 8 changer transitions 0/262 dead transitions. [2024-11-12 12:33:25,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 262 transitions, 667 flow [2024-11-12 12:33:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2024-11-12 12:33:25,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8783269961977186 [2024-11-12 12:33:25,672 INFO L175 Difference]: Start difference. First operand has 247 places, 241 transitions, 508 flow. Second operand 3 states and 693 transitions. [2024-11-12 12:33:25,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 262 transitions, 667 flow [2024-11-12 12:33:25,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 262 transitions, 657 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:33:25,677 INFO L231 Difference]: Finished difference. Result has 244 places, 245 transitions, 554 flow [2024-11-12 12:33:25,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=244, PETRI_TRANSITIONS=245} [2024-11-12 12:33:25,679 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -3 predicate places. [2024-11-12 12:33:25,679 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 245 transitions, 554 flow [2024-11-12 12:33:25,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:25,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:25,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:25,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:33:25,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-12 12:33:25,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:25,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1512932858, now seen corresponding path program 1 times [2024-11-12 12:33:25,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:25,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029239519] [2024-11-12 12:33:25,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:25,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:25,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029239519] [2024-11-12 12:33:25,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029239519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:25,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:25,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:33:25,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959116662] [2024-11-12 12:33:25,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:25,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:25,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:25,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:25,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:25,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 263 [2024-11-12 12:33:25,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 245 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:25,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:25,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 263 [2024-11-12 12:33:25,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:26,517 INFO L124 PetriNetUnfolderBase]: 1320/7689 cut-off events. [2024-11-12 12:33:26,518 INFO L125 PetriNetUnfolderBase]: For 412/458 co-relation queries the response was YES. [2024-11-12 12:33:26,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10499 conditions, 7689 events. 1320/7689 cut-off events. For 412/458 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 78404 event pairs, 566 based on Foata normal form. 1/7029 useless extension candidates. Maximal degree in co-relation 4494. Up to 1811 conditions per place. [2024-11-12 12:33:26,545 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 27 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-11-12 12:33:26,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 250 transitions, 622 flow [2024-11-12 12:33:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2024-11-12 12:33:26,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8745247148288974 [2024-11-12 12:33:26,547 INFO L175 Difference]: Start difference. First operand has 244 places, 245 transitions, 554 flow. Second operand 3 states and 690 transitions. [2024-11-12 12:33:26,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 250 transitions, 622 flow [2024-11-12 12:33:26,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 250 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:33:26,553 INFO L231 Difference]: Finished difference. Result has 245 places, 246 transitions, 550 flow [2024-11-12 12:33:26,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=245, PETRI_TRANSITIONS=246} [2024-11-12 12:33:26,554 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -2 predicate places. [2024-11-12 12:33:26,555 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 246 transitions, 550 flow [2024-11-12 12:33:26,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:26,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:26,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:26,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:33:26,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-12 12:33:26,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:26,556 INFO L85 PathProgramCache]: Analyzing trace with hash 385168878, now seen corresponding path program 1 times [2024-11-12 12:33:26,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:26,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124682437] [2024-11-12 12:33:26,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:26,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:26,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:26,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124682437] [2024-11-12 12:33:26,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124682437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:26,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:26,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:33:26,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002651721] [2024-11-12 12:33:26,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:26,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:33:26,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:26,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:33:26,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:33:26,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 263 [2024-11-12 12:33:26,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 246 transitions, 550 flow. Second operand has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:26,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:26,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 263 [2024-11-12 12:33:26,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:27,443 INFO L124 PetriNetUnfolderBase]: 1393/8631 cut-off events. [2024-11-12 12:33:27,444 INFO L125 PetriNetUnfolderBase]: For 166/178 co-relation queries the response was YES. [2024-11-12 12:33:27,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11191 conditions, 8631 events. 1393/8631 cut-off events. For 166/178 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 89582 event pairs, 415 based on Foata normal form. 5/7901 useless extension candidates. Maximal degree in co-relation 5135. Up to 1757 conditions per place. [2024-11-12 12:33:27,476 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 44 selfloop transitions, 5 changer transitions 0/268 dead transitions. [2024-11-12 12:33:27,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 268 transitions, 692 flow [2024-11-12 12:33:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:33:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:33:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1358 transitions. [2024-11-12 12:33:27,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8605830164765526 [2024-11-12 12:33:27,480 INFO L175 Difference]: Start difference. First operand has 245 places, 246 transitions, 550 flow. Second operand 6 states and 1358 transitions. [2024-11-12 12:33:27,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 268 transitions, 692 flow [2024-11-12 12:33:27,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 268 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:33:27,489 INFO L231 Difference]: Finished difference. Result has 252 places, 248 transitions, 574 flow [2024-11-12 12:33:27,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=574, PETRI_PLACES=252, PETRI_TRANSITIONS=248} [2024-11-12 12:33:27,491 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 5 predicate places. [2024-11-12 12:33:27,491 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 248 transitions, 574 flow [2024-11-12 12:33:27,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:27,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:27,492 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:27,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:33:27,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-12 12:33:27,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1048926782, now seen corresponding path program 1 times [2024-11-12 12:33:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140452786] [2024-11-12 12:33:27,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:27,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:33:27,521 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:33:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:33:27,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:33:27,549 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:33:27,549 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-12 12:33:27,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-12 12:33:27,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-12 12:33:27,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-12 12:33:27,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-12 12:33:27,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-12 12:33:27,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-12 12:33:27,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-12 12:33:27,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-12 12:33:27,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-12 12:33:27,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:33:27,551 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 12:33:27,552 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 12:33:27,552 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-12 12:33:27,576 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-12 12:33:27,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 295 transitions, 617 flow [2024-11-12 12:33:27,654 INFO L124 PetriNetUnfolderBase]: 68/726 cut-off events. [2024-11-12 12:33:27,654 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-12 12:33:27,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 726 events. 68/726 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2924 event pairs, 1 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 519. Up to 16 conditions per place. [2024-11-12 12:33:27,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 295 transitions, 617 flow [2024-11-12 12:33:27,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 295 transitions, 617 flow [2024-11-12 12:33:27,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:33:27,664 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;@50d6930d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:33:27,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-12 12:33:27,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:33:27,670 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2024-11-12 12:33:27,670 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:33:27,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:27,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:27,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-12 12:33:27,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash 394132282, now seen corresponding path program 1 times [2024-11-12 12:33:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:27,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008830940] [2024-11-12 12:33:27,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:27,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:27,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008830940] [2024-11-12 12:33:27,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008830940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:27,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:27,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:33:27,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214608781] [2024-11-12 12:33:27,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:27,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:33:27,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:27,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:33:27,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:33:28,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 295 [2024-11-12 12:33:28,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 295 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 230.5) internal successors, (1383), 6 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:28,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:28,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 295 [2024-11-12 12:33:28,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:30,787 INFO L124 PetriNetUnfolderBase]: 8120/27179 cut-off events. [2024-11-12 12:33:30,787 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2024-11-12 12:33:30,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38914 conditions, 27179 events. 8120/27179 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 327880 event pairs, 710 based on Foata normal form. 6819/32198 useless extension candidates. Maximal degree in co-relation 6339. Up to 8631 conditions per place. [2024-11-12 12:33:30,929 INFO L140 encePairwiseOnDemand]: 268/295 looper letters, 84 selfloop transitions, 5 changer transitions 0/315 dead transitions. [2024-11-12 12:33:30,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 315 transitions, 835 flow [2024-11-12 12:33:30,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:33:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:33:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1533 transitions. [2024-11-12 12:33:30,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8661016949152542 [2024-11-12 12:33:30,933 INFO L175 Difference]: Start difference. First operand has 276 places, 295 transitions, 617 flow. Second operand 6 states and 1533 transitions. [2024-11-12 12:33:30,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 315 transitions, 835 flow [2024-11-12 12:33:30,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 315 transitions, 835 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:33:30,938 INFO L231 Difference]: Finished difference. Result has 274 places, 267 transitions, 571 flow [2024-11-12 12:33:30,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=274, PETRI_TRANSITIONS=267} [2024-11-12 12:33:30,939 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -2 predicate places. [2024-11-12 12:33:30,940 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 267 transitions, 571 flow [2024-11-12 12:33:30,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 230.5) internal successors, (1383), 6 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:30,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:30,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:30,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:33:30,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-12 12:33:30,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1124076703, now seen corresponding path program 1 times [2024-11-12 12:33:30,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:30,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816392676] [2024-11-12 12:33:30,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:30,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:30,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:30,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816392676] [2024-11-12 12:33:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816392676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:30,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:30,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:33:30,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026935016] [2024-11-12 12:33:30,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:30,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:30,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:30,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:30,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 295 [2024-11-12 12:33:30,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 267 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:30,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:30,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 295 [2024-11-12 12:33:30,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:39,416 INFO L124 PetriNetUnfolderBase]: 27267/82271 cut-off events. [2024-11-12 12:33:39,416 INFO L125 PetriNetUnfolderBase]: For 2763/4664 co-relation queries the response was YES. [2024-11-12 12:33:39,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121909 conditions, 82271 events. 27267/82271 cut-off events. For 2763/4664 co-relation queries the response was YES. Maximal size of possible extension queue 1760. Compared 1093709 event pairs, 10774 based on Foata normal form. 32/74598 useless extension candidates. Maximal degree in co-relation 109328. Up to 25188 conditions per place. [2024-11-12 12:33:39,859 INFO L140 encePairwiseOnDemand]: 280/295 looper letters, 60 selfloop transitions, 10 changer transitions 0/296 dead transitions. [2024-11-12 12:33:39,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 296 transitions, 790 flow [2024-11-12 12:33:39,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2024-11-12 12:33:39,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.864406779661017 [2024-11-12 12:33:39,862 INFO L175 Difference]: Start difference. First operand has 274 places, 267 transitions, 571 flow. Second operand 3 states and 765 transitions. [2024-11-12 12:33:39,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 296 transitions, 790 flow [2024-11-12 12:33:39,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 296 transitions, 780 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:33:39,867 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 635 flow [2024-11-12 12:33:39,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2024-11-12 12:33:39,868 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -5 predicate places. [2024-11-12 12:33:39,868 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 635 flow [2024-11-12 12:33:39,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:39,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:39,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:39,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:33:39,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-12 12:33:39,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:39,870 INFO L85 PathProgramCache]: Analyzing trace with hash -976797254, now seen corresponding path program 1 times [2024-11-12 12:33:39,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:39,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634716306] [2024-11-12 12:33:39,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:39,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:39,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:39,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634716306] [2024-11-12 12:33:39,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634716306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:39,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:39,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:33:39,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326638830] [2024-11-12 12:33:39,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:39,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:39,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:39,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:39,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:39,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 295 [2024-11-12 12:33:39,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 635 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:39,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:39,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 295 [2024-11-12 12:33:39,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:46,903 INFO L124 PetriNetUnfolderBase]: 16115/65598 cut-off events. [2024-11-12 12:33:46,903 INFO L125 PetriNetUnfolderBase]: For 3998/5356 co-relation queries the response was YES. [2024-11-12 12:33:47,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94577 conditions, 65598 events. 16115/65598 cut-off events. For 3998/5356 co-relation queries the response was YES. Maximal size of possible extension queue 1316. Compared 935316 event pairs, 9055 based on Foata normal form. 1/59281 useless extension candidates. Maximal degree in co-relation 41123. Up to 19175 conditions per place. [2024-11-12 12:33:47,288 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 33 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-11-12 12:33:47,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 278 transitions, 715 flow [2024-11-12 12:33:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2024-11-12 12:33:47,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8576271186440678 [2024-11-12 12:33:47,291 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 635 flow. Second operand 3 states and 759 transitions. [2024-11-12 12:33:47,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 278 transitions, 715 flow [2024-11-12 12:33:47,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 278 transitions, 695 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:33:47,326 INFO L231 Difference]: Finished difference. Result has 272 places, 274 transitions, 627 flow [2024-11-12 12:33:47,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=272, PETRI_TRANSITIONS=274} [2024-11-12 12:33:47,327 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -4 predicate places. [2024-11-12 12:33:47,327 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 274 transitions, 627 flow [2024-11-12 12:33:47,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:47,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:47,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:47,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:33:47,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-12 12:33:47,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash -806737296, now seen corresponding path program 1 times [2024-11-12 12:33:47,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:47,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443151759] [2024-11-12 12:33:47,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:47,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:47,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:47,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443151759] [2024-11-12 12:33:47,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443151759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:47,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:47,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:33:47,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050226960] [2024-11-12 12:33:47,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:47,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:33:47,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:47,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:33:47,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:33:47,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 295 [2024-11-12 12:33:47,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 274 transitions, 627 flow. Second operand has 5 states, 5 states have (on average 240.6) internal successors, (1203), 5 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:47,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:47,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 295 [2024-11-12 12:33:47,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:55,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, 106#L708-3true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 157#L715-12true, 294#true, 290#true, 275#true, 155#L715-5true, 273#true]) [2024-11-12 12:33:55,396 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2024-11-12 12:33:55,396 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-11-12 12:33:55,396 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-11-12 12:33:55,396 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2024-11-12 12:33:55,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 214#L715-6true, 277#true, 106#L708-3true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 157#L715-12true, 294#true, 290#true, 275#true, 273#true]) [2024-11-12 12:33:55,397 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2024-11-12 12:33:55,397 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-12 12:33:55,397 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-12 12:33:55,397 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-11-12 12:33:55,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 277#true, 106#L708-3true, 112#L715-12true, 101#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 294#true, 290#true, 275#true, 273#true]) [2024-11-12 12:33:55,397 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2024-11-12 12:33:55,397 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-11-12 12:33:55,397 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-11-12 12:33:55,397 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2024-11-12 12:33:55,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 294#true, 157#L715-12true, 290#true, 215#ULTIMATE.startFINALtrue, 275#true, 155#L715-5true, 273#true]) [2024-11-12 12:33:55,460 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2024-11-12 12:33:55,460 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-11-12 12:33:55,460 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-12 12:33:55,460 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-12 12:33:55,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 214#L715-6true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 294#true, 157#L715-12true, 290#true, 215#ULTIMATE.startFINALtrue, 275#true, 273#true]) [2024-11-12 12:33:55,460 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2024-11-12 12:33:55,460 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-12 12:33:55,460 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-12 12:33:55,460 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-12 12:33:55,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 277#true, 112#L715-12true, 101#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 294#true, 290#true, 215#ULTIMATE.startFINALtrue, 275#true, 273#true]) [2024-11-12 12:33:55,460 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2024-11-12 12:33:55,460 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-12 12:33:55,460 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-11-12 12:33:55,460 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-12 12:33:55,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, 106#L708-3true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 157#L715-12true, 294#true, 290#true, 275#true, 153#L716-2true, 155#L715-5true, 273#true]) [2024-11-12 12:33:55,559 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2024-11-12 12:33:55,559 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2024-11-12 12:33:55,559 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2024-11-12 12:33:55,559 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-12 12:33:55,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 214#L715-6true, 277#true, 106#L708-3true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 157#L715-12true, 294#true, 290#true, 275#true, 153#L716-2true, 273#true]) [2024-11-12 12:33:55,559 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2024-11-12 12:33:55,559 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-11-12 12:33:55,559 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-12 12:33:55,559 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-12 12:33:55,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 277#true, 106#L708-3true, 112#L715-12true, 101#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 275#true, 153#L716-2true, 273#true]) [2024-11-12 12:33:55,559 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2024-11-12 12:33:55,559 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2024-11-12 12:33:55,559 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2024-11-12 12:33:55,559 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-12 12:33:55,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 294#true, 157#L715-12true, 290#true, 275#true, 155#L715-5true, 273#true, 119#L709-3true]) [2024-11-12 12:33:55,566 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2024-11-12 12:33:55,566 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-12 12:33:55,566 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2024-11-12 12:33:55,566 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2024-11-12 12:33:55,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 214#L715-6true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 294#true, 157#L715-12true, 290#true, 275#true, 273#true, 119#L709-3true]) [2024-11-12 12:33:55,566 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2024-11-12 12:33:55,566 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-11-12 12:33:55,566 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-12 12:33:55,566 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-12 12:33:55,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 277#true, 112#L715-12true, 101#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 294#true, 290#true, 275#true, 273#true, 119#L709-3true]) [2024-11-12 12:33:55,566 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2024-11-12 12:33:55,566 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2024-11-12 12:33:55,566 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2024-11-12 12:33:55,566 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-12 12:33:55,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 157#L715-12true, 294#true, 290#true, 215#ULTIMATE.startFINALtrue, 275#true, 153#L716-2true, 155#L715-5true, 273#true]) [2024-11-12 12:33:55,607 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2024-11-12 12:33:55,607 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-11-12 12:33:55,607 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-12 12:33:55,607 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-12 12:33:55,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 214#L715-6true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 157#L715-12true, 294#true, 290#true, 215#ULTIMATE.startFINALtrue, 275#true, 153#L716-2true, 273#true]) [2024-11-12 12:33:55,608 INFO L294 olderBase$Statistics]: this new event has 237 ancestors and is cut-off event [2024-11-12 12:33:55,608 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2024-11-12 12:33:55,608 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-12 12:33:55,608 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-12 12:33:55,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 277#true, 112#L715-12true, 101#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 215#ULTIMATE.startFINALtrue, 275#true, 153#L716-2true, 273#true]) [2024-11-12 12:33:55,608 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2024-11-12 12:33:55,608 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-11-12 12:33:55,608 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-12 12:33:55,608 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-12 12:33:55,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([944] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 214#L715-6true, 277#true, 189#L709-5true, 61#L715-6true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 294#true, 290#true, 275#true, 273#true]) [2024-11-12 12:33:55,614 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([944] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 214#L715-6true, 277#true, 189#L709-5true, 101#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 294#true, 290#true, 275#true, 273#true]) [2024-11-12 12:33:55,615 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([944] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 277#true, 189#L709-5true, 61#L715-6true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 294#true, 290#true, 275#true, 155#L715-5true, 273#true]) [2024-11-12 12:33:55,615 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([944] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 277#true, 189#L709-5true, 101#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 96#L715-12true, 294#true, 290#true, 275#true, 155#L715-5true, 273#true]) [2024-11-12 12:33:55,615 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2024-11-12 12:33:55,615 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2024-11-12 12:33:55,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 157#L715-12true, 294#true, 290#true, 275#true, 153#L716-2true, 155#L715-5true, 273#true, 119#L709-3true]) [2024-11-12 12:33:55,691 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2024-11-12 12:33:55,691 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-11-12 12:33:55,691 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-11-12 12:33:55,691 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2024-11-12 12:33:55,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 214#L715-6true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 157#L715-12true, 294#true, 290#true, 275#true, 153#L716-2true, 273#true, 119#L709-3true]) [2024-11-12 12:33:55,691 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2024-11-12 12:33:55,691 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-11-12 12:33:55,691 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-11-12 12:33:55,692 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2024-11-12 12:33:55,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 112#L715-12true, 277#true, 101#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 275#true, 153#L716-2true, 273#true, 119#L709-3true]) [2024-11-12 12:33:55,692 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2024-11-12 12:33:55,692 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-11-12 12:33:55,692 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-11-12 12:33:55,692 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2024-11-12 12:33:55,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([944] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 214#L715-6true, 277#true, 189#L709-5true, 61#L715-6true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 275#true, 153#L716-2true, 273#true]) [2024-11-12 12:33:55,729 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2024-11-12 12:33:55,729 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-12 12:33:55,729 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-12 12:33:55,729 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-12 12:33:55,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([944] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [214#L715-6true, Black: 285#true, 277#true, 189#L709-5true, 101#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 275#true, 153#L716-2true, 273#true]) [2024-11-12 12:33:55,729 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2024-11-12 12:33:55,729 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-12 12:33:55,729 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-12 12:33:55,729 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-11-12 12:33:55,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([944] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 277#true, 189#L709-5true, 61#L715-6true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 275#true, 153#L716-2true, 155#L715-5true, 273#true]) [2024-11-12 12:33:55,729 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2024-11-12 12:33:55,729 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-12 12:33:55,729 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-11-12 12:33:55,729 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-12 12:33:55,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([944] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][242], [Black: 285#true, 277#true, 101#L715-5true, 189#L709-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 275#true, 153#L716-2true, 155#L715-5true, 273#true]) [2024-11-12 12:33:55,730 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2024-11-12 12:33:55,730 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2024-11-12 12:33:55,730 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-11-12 12:33:55,730 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-11-12 12:33:55,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 157#L715-12true, 290#true, 275#true, 155#L715-5true, 272#true, 95#L722-10true]) [2024-11-12 12:33:55,762 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2024-11-12 12:33:55,762 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-12 12:33:55,762 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2024-11-12 12:33:55,762 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-12 12:33:55,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 214#L715-6true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 157#L715-12true, 290#true, 275#true, 272#true, 95#L722-10true]) [2024-11-12 12:33:55,762 INFO L294 olderBase$Statistics]: this new event has 241 ancestors and is cut-off event [2024-11-12 12:33:55,762 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-12 12:33:55,762 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2024-11-12 12:33:55,762 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-12 12:33:55,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 277#true, 112#L715-12true, 101#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 275#true, 272#true, 95#L722-10true]) [2024-11-12 12:33:55,763 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2024-11-12 12:33:55,763 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-12 12:33:55,763 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2024-11-12 12:33:55,763 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-12 12:33:56,215 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 157#L715-12true, 290#true, 215#ULTIMATE.startFINALtrue, 275#true, 155#L715-5true, 272#true]) [2024-11-12 12:33:56,216 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2024-11-12 12:33:56,216 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-11-12 12:33:56,216 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-11-12 12:33:56,216 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-12 12:33:56,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1186] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 285#true, 214#L715-6true, 277#true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 157#L715-12true, 290#true, 215#ULTIMATE.startFINALtrue, 275#true, 272#true]) [2024-11-12 12:33:56,216 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-12 12:33:56,216 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-12 12:33:56,216 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-12 12:33:56,216 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-12 12:33:56,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][178], [Black: 285#true, 277#true, 112#L715-12true, 101#L715-5true, Black: 292#(= |ULTIMATE.start_main_~i~1#1| 0), 294#true, 290#true, 215#ULTIMATE.startFINALtrue, 275#true, 272#true]) [2024-11-12 12:33:56,216 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2024-11-12 12:33:56,216 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-11-12 12:33:56,217 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-11-12 12:33:56,217 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-12 12:33:56,318 INFO L124 PetriNetUnfolderBase]: 17529/83461 cut-off events. [2024-11-12 12:33:56,318 INFO L125 PetriNetUnfolderBase]: For 2142/2216 co-relation queries the response was YES. [2024-11-12 12:33:56,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111282 conditions, 83461 events. 17529/83461 cut-off events. For 2142/2216 co-relation queries the response was YES. Maximal size of possible extension queue 1338. Compared 1258562 event pairs, 6187 based on Foata normal form. 5/75544 useless extension candidates. Maximal degree in co-relation 97077. Up to 20381 conditions per place. [2024-11-12 12:33:56,767 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 52 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2024-11-12 12:33:56,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 298 transitions, 791 flow [2024-11-12 12:33:56,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:33:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:33:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1492 transitions. [2024-11-12 12:33:56,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8429378531073446 [2024-11-12 12:33:56,773 INFO L175 Difference]: Start difference. First operand has 272 places, 274 transitions, 627 flow. Second operand 6 states and 1492 transitions. [2024-11-12 12:33:56,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 298 transitions, 791 flow [2024-11-12 12:33:56,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 298 transitions, 789 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:33:56,778 INFO L231 Difference]: Finished difference. Result has 279 places, 277 transitions, 657 flow [2024-11-12 12:33:56,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=657, PETRI_PLACES=279, PETRI_TRANSITIONS=277} [2024-11-12 12:33:56,779 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 3 predicate places. [2024-11-12 12:33:56,779 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 277 transitions, 657 flow [2024-11-12 12:33:56,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 240.6) internal successors, (1203), 5 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:56,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:56,780 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:56,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:33:56,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-12 12:33:56,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1218816187, now seen corresponding path program 1 times [2024-11-12 12:33:56,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:56,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396952356] [2024-11-12 12:33:56,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:56,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:56,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396952356] [2024-11-12 12:33:56,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396952356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:56,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:56,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:33:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754236856] [2024-11-12 12:33:56,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:56,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:56,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:56,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:56,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 295 [2024-11-12 12:33:56,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 277 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:56,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:56,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 295 [2024-11-12 12:33:56,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand