./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.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 a77d68c8e15036e88d70009e5342d88dd2f93f021b72148028da08073ac36a38 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:39:26,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:39:26,087 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:39:26,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:39:26,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:39:26,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:39:26,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:39:26,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:39:26,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:39:26,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:39:26,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:39:26,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:39:26,120 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:39:26,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:39:26,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:39:26,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:39:26,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:39:26,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:39:26,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:39:26,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:39:26,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:39:26,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:39:26,124 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:39:26,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:39:26,125 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:39:26,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:39:26,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:39:26,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:39:26,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:39:26,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:39:26,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:39:26,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:39:26,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:39:26,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:39:26,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:39:26,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:39:26,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:39:26,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:39:26,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:39:26,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:39:26,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:39:26,129 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 -> a77d68c8e15036e88d70009e5342d88dd2f93f021b72148028da08073ac36a38 [2024-10-24 15:39:26,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:39:26,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:39:26,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:39:26,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:39:26,347 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:39:26,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i [2024-10-24 15:39:27,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:39:27,730 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:39:27,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i [2024-10-24 15:39:27,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f58ebe5a6/3e4c0e5f690941ab8b8e6a2940d10ec6/FLAG2f8b04b69 [2024-10-24 15:39:27,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f58ebe5a6/3e4c0e5f690941ab8b8e6a2940d10ec6 [2024-10-24 15:39:27,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:39:27,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:39:27,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:39:27,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:39:27,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:39:27,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:39:27" (1/1) ... [2024-10-24 15:39:27,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a54b191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:27, skipping insertion in model container [2024-10-24 15:39:27,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:39:27" (1/1) ... [2024-10-24 15:39:27,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:39:28,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:39:28,101 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:39:28,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:39:28,180 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:39:28,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28 WrapperNode [2024-10-24 15:39:28,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:39:28,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:39:28,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:39:28,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:39:28,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,216 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2024-10-24 15:39:28,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:39:28,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:39:28,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:39:28,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:39:28,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:39:28,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:39:28,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:39:28,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:39:28,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:39:28,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:39:28,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 15:39:28,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 15:39:28,311 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 15:39:28,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:39:28,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 15:39:28,312 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-24 15:39:28,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-24 15:39:28,312 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 15:39:28,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:39:28,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:39:28,313 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:39:28,423 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:39:28,425 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:39:28,600 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:39:28,600 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:39:28,635 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:39:28,635 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 15:39:28,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:28 BoogieIcfgContainer [2024-10-24 15:39:28,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:39:28,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:39:28,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:39:28,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:39:28,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:39:27" (1/3) ... [2024-10-24 15:39:28,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48146bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:39:28, skipping insertion in model container [2024-10-24 15:39:28,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (2/3) ... [2024-10-24 15:39:28,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48146bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:39:28, skipping insertion in model container [2024-10-24 15:39:28,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:28" (3/3) ... [2024-10-24 15:39:28,643 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-3.i [2024-10-24 15:39:28,655 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:39:28,655 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-24 15:39:28,655 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:39:28,704 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 15:39:28,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 139 transitions, 282 flow [2024-10-24 15:39:28,798 INFO L124 PetriNetUnfolderBase]: 7/181 cut-off events. [2024-10-24 15:39:28,800 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:28,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 181 events. 7/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 240 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 98. Up to 4 conditions per place. [2024-10-24 15:39:28,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 139 transitions, 282 flow [2024-10-24 15:39:28,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 139 transitions, 282 flow [2024-10-24 15:39:28,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:39:28,827 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;@6cf6cbd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:39:28,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-24 15:39:28,845 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:39:28,846 INFO L124 PetriNetUnfolderBase]: 2/65 cut-off events. [2024-10-24 15:39:28,846 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:28,846 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:28,847 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:28,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:28,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1637793038, now seen corresponding path program 1 times [2024-10-24 15:39:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:28,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352455945] [2024-10-24 15:39:28,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:28,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:29,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:29,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352455945] [2024-10-24 15:39:29,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352455945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:29,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:29,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:29,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961065182] [2024-10-24 15:39:29,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:29,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:29,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:29,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:29,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:29,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2024-10-24 15:39:29,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 139 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:29,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:29,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2024-10-24 15:39:29,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:29,337 INFO L124 PetriNetUnfolderBase]: 98/613 cut-off events. [2024-10-24 15:39:29,337 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 15:39:29,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 613 events. 98/613 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3330 event pairs, 33 based on Foata normal form. 9/564 useless extension candidates. Maximal degree in co-relation 731. Up to 138 conditions per place. [2024-10-24 15:39:29,342 INFO L140 encePairwiseOnDemand]: 125/139 looper letters, 32 selfloop transitions, 8 changer transitions 1/154 dead transitions. [2024-10-24 15:39:29,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 154 transitions, 392 flow [2024-10-24 15:39:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2024-10-24 15:39:29,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935251798561151 [2024-10-24 15:39:29,355 INFO L175 Difference]: Start difference. First operand has 138 places, 139 transitions, 282 flow. Second operand 3 states and 390 transitions. [2024-10-24 15:39:29,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 154 transitions, 392 flow [2024-10-24 15:39:29,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 154 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:39:29,362 INFO L231 Difference]: Finished difference. Result has 142 places, 143 transitions, 344 flow [2024-10-24 15:39:29,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=142, PETRI_TRANSITIONS=143} [2024-10-24 15:39:29,367 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 4 predicate places. [2024-10-24 15:39:29,367 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 143 transitions, 344 flow [2024-10-24 15:39:29,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:29,368 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:29,368 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:29,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:39:29,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:29,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:29,370 INFO L85 PathProgramCache]: Analyzing trace with hash -2030281524, now seen corresponding path program 1 times [2024-10-24 15:39:29,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:29,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496970603] [2024-10-24 15:39:29,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:29,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:29,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:29,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496970603] [2024-10-24 15:39:29,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496970603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:29,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:29,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:29,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485708820] [2024-10-24 15:39:29,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:29,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:29,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:29,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:29,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:29,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2024-10-24 15:39:29,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 143 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:29,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:29,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2024-10-24 15:39:29,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:29,593 INFO L124 PetriNetUnfolderBase]: 114/750 cut-off events. [2024-10-24 15:39:29,594 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2024-10-24 15:39:29,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 750 events. 114/750 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4473 event pairs, 72 based on Foata normal form. 4/698 useless extension candidates. Maximal degree in co-relation 1058. Up to 226 conditions per place. [2024-10-24 15:39:29,599 INFO L140 encePairwiseOnDemand]: 133/139 looper letters, 29 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2024-10-24 15:39:29,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 444 flow [2024-10-24 15:39:29,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-10-24 15:39:29,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.894484412470024 [2024-10-24 15:39:29,604 INFO L175 Difference]: Start difference. First operand has 142 places, 143 transitions, 344 flow. Second operand 3 states and 373 transitions. [2024-10-24 15:39:29,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 152 transitions, 444 flow [2024-10-24 15:39:29,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 152 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:29,609 INFO L231 Difference]: Finished difference. Result has 143 places, 148 transitions, 384 flow [2024-10-24 15:39:29,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=143, PETRI_TRANSITIONS=148} [2024-10-24 15:39:29,610 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 5 predicate places. [2024-10-24 15:39:29,611 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 148 transitions, 384 flow [2024-10-24 15:39:29,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:29,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:29,611 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:29,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:39:29,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:29,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:29,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1640232873, now seen corresponding path program 1 times [2024-10-24 15:39:29,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:29,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94777500] [2024-10-24 15:39:29,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:29,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:29,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:29,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94777500] [2024-10-24 15:39:29,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94777500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:29,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:29,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:39:29,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640221315] [2024-10-24 15:39:29,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:29,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:29,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:29,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:29,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:29,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2024-10-24 15:39:29,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 148 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:29,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:29,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2024-10-24 15:39:29,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:29,857 INFO L124 PetriNetUnfolderBase]: 93/667 cut-off events. [2024-10-24 15:39:29,857 INFO L125 PetriNetUnfolderBase]: For 70/74 co-relation queries the response was YES. [2024-10-24 15:39:29,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 667 events. 93/667 cut-off events. For 70/74 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3868 event pairs, 56 based on Foata normal form. 3/617 useless extension candidates. Maximal degree in co-relation 884. Up to 144 conditions per place. [2024-10-24 15:39:29,860 INFO L140 encePairwiseOnDemand]: 136/139 looper letters, 15 selfloop transitions, 2 changer transitions 3/153 dead transitions. [2024-10-24 15:39:29,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 153 transitions, 434 flow [2024-10-24 15:39:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2024-10-24 15:39:29,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.920863309352518 [2024-10-24 15:39:29,861 INFO L175 Difference]: Start difference. First operand has 143 places, 148 transitions, 384 flow. Second operand 3 states and 384 transitions. [2024-10-24 15:39:29,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 153 transitions, 434 flow [2024-10-24 15:39:29,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 153 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:29,865 INFO L231 Difference]: Finished difference. Result has 144 places, 149 transitions, 382 flow [2024-10-24 15:39:29,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=144, PETRI_TRANSITIONS=149} [2024-10-24 15:39:29,866 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 6 predicate places. [2024-10-24 15:39:29,867 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 149 transitions, 382 flow [2024-10-24 15:39:29,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:29,867 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:29,867 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:29,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:39:29,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:29,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash 260494260, now seen corresponding path program 1 times [2024-10-24 15:39:29,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:29,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297876946] [2024-10-24 15:39:29,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:29,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:29,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297876946] [2024-10-24 15:39:29,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297876946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:29,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:29,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:29,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928855272] [2024-10-24 15:39:29,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:29,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:29,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:29,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:29,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:29,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 139 [2024-10-24 15:39:29,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 149 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:29,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:29,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 139 [2024-10-24 15:39:29,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:30,005 INFO L124 PetriNetUnfolderBase]: 93/628 cut-off events. [2024-10-24 15:39:30,006 INFO L125 PetriNetUnfolderBase]: For 36/40 co-relation queries the response was YES. [2024-10-24 15:39:30,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 628 events. 93/628 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3678 event pairs, 55 based on Foata normal form. 0/584 useless extension candidates. Maximal degree in co-relation 859. Up to 131 conditions per place. [2024-10-24 15:39:30,010 INFO L140 encePairwiseOnDemand]: 134/139 looper letters, 22 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2024-10-24 15:39:30,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 158 transitions, 452 flow [2024-10-24 15:39:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2024-10-24 15:39:30,013 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.920863309352518 [2024-10-24 15:39:30,013 INFO L175 Difference]: Start difference. First operand has 144 places, 149 transitions, 382 flow. Second operand 3 states and 384 transitions. [2024-10-24 15:39:30,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 158 transitions, 452 flow [2024-10-24 15:39:30,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 158 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:39:30,018 INFO L231 Difference]: Finished difference. Result has 147 places, 152 transitions, 410 flow [2024-10-24 15:39:30,019 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=147, PETRI_TRANSITIONS=152} [2024-10-24 15:39:30,019 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 9 predicate places. [2024-10-24 15:39:30,019 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 152 transitions, 410 flow [2024-10-24 15:39:30,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:30,020 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:30,020 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:30,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:39:30,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:30,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:30,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2014324121, now seen corresponding path program 1 times [2024-10-24 15:39:30,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:30,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065475124] [2024-10-24 15:39:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:39:30,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:30,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065475124] [2024-10-24 15:39:30,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065475124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:30,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:30,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:30,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074093178] [2024-10-24 15:39:30,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:30,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:30,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:30,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:30,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:30,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2024-10-24 15:39:30,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 152 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:30,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:30,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2024-10-24 15:39:30,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:30,180 INFO L124 PetriNetUnfolderBase]: 85/675 cut-off events. [2024-10-24 15:39:30,180 INFO L125 PetriNetUnfolderBase]: For 84/91 co-relation queries the response was YES. [2024-10-24 15:39:30,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 675 events. 85/675 cut-off events. For 84/91 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4081 event pairs, 45 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 938. Up to 113 conditions per place. [2024-10-24 15:39:30,182 INFO L140 encePairwiseOnDemand]: 135/139 looper letters, 17 selfloop transitions, 4 changer transitions 1/158 dead transitions. [2024-10-24 15:39:30,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 158 transitions, 470 flow [2024-10-24 15:39:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2024-10-24 15:39:30,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9232613908872902 [2024-10-24 15:39:30,184 INFO L175 Difference]: Start difference. First operand has 147 places, 152 transitions, 410 flow. Second operand 3 states and 385 transitions. [2024-10-24 15:39:30,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 158 transitions, 470 flow [2024-10-24 15:39:30,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 158 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:30,188 INFO L231 Difference]: Finished difference. Result has 149 places, 154 transitions, 430 flow [2024-10-24 15:39:30,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=149, PETRI_TRANSITIONS=154} [2024-10-24 15:39:30,190 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 11 predicate places. [2024-10-24 15:39:30,190 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 154 transitions, 430 flow [2024-10-24 15:39:30,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:30,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:30,191 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:30,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:39:30,191 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:30,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1408818577, now seen corresponding path program 1 times [2024-10-24 15:39:30,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:30,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147634330] [2024-10-24 15:39:30,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:30,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147634330] [2024-10-24 15:39:30,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147634330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:30,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:30,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:30,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035698566] [2024-10-24 15:39:30,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:30,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:30,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:30,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:30,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:30,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 139 [2024-10-24 15:39:30,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 154 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:30,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:30,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 139 [2024-10-24 15:39:30,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:30,356 INFO L124 PetriNetUnfolderBase]: 159/861 cut-off events. [2024-10-24 15:39:30,357 INFO L125 PetriNetUnfolderBase]: For 190/196 co-relation queries the response was YES. [2024-10-24 15:39:30,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 861 events. 159/861 cut-off events. For 190/196 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5473 event pairs, 73 based on Foata normal form. 1/825 useless extension candidates. Maximal degree in co-relation 1418. Up to 274 conditions per place. [2024-10-24 15:39:30,359 INFO L140 encePairwiseOnDemand]: 132/139 looper letters, 29 selfloop transitions, 11 changer transitions 4/167 dead transitions. [2024-10-24 15:39:30,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 167 transitions, 552 flow [2024-10-24 15:39:30,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2024-10-24 15:39:30,360 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9112709832134293 [2024-10-24 15:39:30,361 INFO L175 Difference]: Start difference. First operand has 149 places, 154 transitions, 430 flow. Second operand 3 states and 380 transitions. [2024-10-24 15:39:30,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 167 transitions, 552 flow [2024-10-24 15:39:30,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 167 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:30,364 INFO L231 Difference]: Finished difference. Result has 151 places, 158 transitions, 498 flow [2024-10-24 15:39:30,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=151, PETRI_TRANSITIONS=158} [2024-10-24 15:39:30,366 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 13 predicate places. [2024-10-24 15:39:30,366 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 158 transitions, 498 flow [2024-10-24 15:39:30,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:30,367 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:30,367 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:30,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:39:30,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:30,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1385277793, now seen corresponding path program 1 times [2024-10-24 15:39:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:30,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783603972] [2024-10-24 15:39:30,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:30,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:30,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:39:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:30,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:39:30,434 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:39:30,435 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-10-24 15:39:30,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-10-24 15:39:30,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-10-24 15:39:30,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-10-24 15:39:30,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-10-24 15:39:30,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-10-24 15:39:30,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-10-24 15:39:30,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-10-24 15:39:30,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-10-24 15:39:30,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-10-24 15:39:30,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-10-24 15:39:30,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:39:30,439 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:30,444 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-24 15:39:30,445 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-24 15:39:30,463 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 15:39:30,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 171 transitions, 352 flow [2024-10-24 15:39:30,482 INFO L124 PetriNetUnfolderBase]: 10/263 cut-off events. [2024-10-24 15:39:30,482 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 15:39:30,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 263 events. 10/263 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 415 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 182. Up to 6 conditions per place. [2024-10-24 15:39:30,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 171 transitions, 352 flow [2024-10-24 15:39:30,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 171 transitions, 352 flow [2024-10-24 15:39:30,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:39:30,486 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;@6cf6cbd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:39:30,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-10-24 15:39:30,489 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:39:30,489 INFO L124 PetriNetUnfolderBase]: 2/65 cut-off events. [2024-10-24 15:39:30,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:30,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:30,490 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:30,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:30,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:30,490 INFO L85 PathProgramCache]: Analyzing trace with hash 225895357, now seen corresponding path program 1 times [2024-10-24 15:39:30,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:30,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257672115] [2024-10-24 15:39:30,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:30,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257672115] [2024-10-24 15:39:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257672115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:30,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:30,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:30,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441239262] [2024-10-24 15:39:30,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:30,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:30,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:30,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:30,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 171 [2024-10-24 15:39:30,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 171 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:30,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:30,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 171 [2024-10-24 15:39:30,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:31,256 INFO L124 PetriNetUnfolderBase]: 2216/7012 cut-off events. [2024-10-24 15:39:31,257 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-10-24 15:39:31,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10716 conditions, 7012 events. 2216/7012 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 68653 event pairs, 879 based on Foata normal form. 92/6345 useless extension candidates. Maximal degree in co-relation 9184. Up to 2089 conditions per place. [2024-10-24 15:39:31,286 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 46 selfloop transitions, 11 changer transitions 1/194 dead transitions. [2024-10-24 15:39:31,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 194 transitions, 517 flow [2024-10-24 15:39:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2024-10-24 15:39:31,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9298245614035088 [2024-10-24 15:39:31,288 INFO L175 Difference]: Start difference. First operand has 172 places, 171 transitions, 352 flow. Second operand 3 states and 477 transitions. [2024-10-24 15:39:31,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 194 transitions, 517 flow [2024-10-24 15:39:31,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 194 transitions, 517 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:39:31,290 INFO L231 Difference]: Finished difference. Result has 176 places, 178 transitions, 440 flow [2024-10-24 15:39:31,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=176, PETRI_TRANSITIONS=178} [2024-10-24 15:39:31,292 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 4 predicate places. [2024-10-24 15:39:31,292 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 178 transitions, 440 flow [2024-10-24 15:39:31,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:31,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:31,292 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:31,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 15:39:31,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:31,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1467184948, now seen corresponding path program 1 times [2024-10-24 15:39:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617465812] [2024-10-24 15:39:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:31,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:31,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617465812] [2024-10-24 15:39:31,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617465812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:31,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:31,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:31,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684418435] [2024-10-24 15:39:31,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:31,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:31,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:31,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:31,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:31,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 171 [2024-10-24 15:39:31,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 178 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:31,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:31,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 171 [2024-10-24 15:39:31,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:32,303 INFO L124 PetriNetUnfolderBase]: 2480/8923 cut-off events. [2024-10-24 15:39:32,303 INFO L125 PetriNetUnfolderBase]: For 2780/2954 co-relation queries the response was YES. [2024-10-24 15:39:32,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15689 conditions, 8923 events. 2480/8923 cut-off events. For 2780/2954 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 94636 event pairs, 1597 based on Foata normal form. 62/8189 useless extension candidates. Maximal degree in co-relation 13582. Up to 3442 conditions per place. [2024-10-24 15:39:32,354 INFO L140 encePairwiseOnDemand]: 163/171 looper letters, 42 selfloop transitions, 12 changer transitions 0/196 dead transitions. [2024-10-24 15:39:32,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 196 transitions, 608 flow [2024-10-24 15:39:32,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2024-10-24 15:39:32,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.898635477582846 [2024-10-24 15:39:32,357 INFO L175 Difference]: Start difference. First operand has 176 places, 178 transitions, 440 flow. Second operand 3 states and 461 transitions. [2024-10-24 15:39:32,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 196 transitions, 608 flow [2024-10-24 15:39:32,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 196 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:32,367 INFO L231 Difference]: Finished difference. Result has 177 places, 188 transitions, 524 flow [2024-10-24 15:39:32,367 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=177, PETRI_TRANSITIONS=188} [2024-10-24 15:39:32,369 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 5 predicate places. [2024-10-24 15:39:32,369 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 188 transitions, 524 flow [2024-10-24 15:39:32,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:32,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:32,370 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:32,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 15:39:32,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:32,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:32,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1916357716, now seen corresponding path program 1 times [2024-10-24 15:39:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:32,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961455563] [2024-10-24 15:39:32,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:32,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:32,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:32,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961455563] [2024-10-24 15:39:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961455563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:32,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:32,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:39:32,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461442144] [2024-10-24 15:39:32,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:32,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:32,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 171 [2024-10-24 15:39:32,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 188 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:32,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:32,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 171 [2024-10-24 15:39:32,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:33,147 INFO L124 PetriNetUnfolderBase]: 1983/8040 cut-off events. [2024-10-24 15:39:33,148 INFO L125 PetriNetUnfolderBase]: For 1235/1680 co-relation queries the response was YES. [2024-10-24 15:39:33,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13185 conditions, 8040 events. 1983/8040 cut-off events. For 1235/1680 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 86861 event pairs, 1348 based on Foata normal form. 34/7266 useless extension candidates. Maximal degree in co-relation 11427. Up to 2229 conditions per place. [2024-10-24 15:39:33,186 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 21 selfloop transitions, 2 changer transitions 3/193 dead transitions. [2024-10-24 15:39:33,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 193 transitions, 586 flow [2024-10-24 15:39:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2024-10-24 15:39:33,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2024-10-24 15:39:33,188 INFO L175 Difference]: Start difference. First operand has 177 places, 188 transitions, 524 flow. Second operand 3 states and 468 transitions. [2024-10-24 15:39:33,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 193 transitions, 586 flow [2024-10-24 15:39:33,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 193 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:33,195 INFO L231 Difference]: Finished difference. Result has 178 places, 189 transitions, 512 flow [2024-10-24 15:39:33,196 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=178, PETRI_TRANSITIONS=189} [2024-10-24 15:39:33,196 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 6 predicate places. [2024-10-24 15:39:33,196 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 189 transitions, 512 flow [2024-10-24 15:39:33,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:33,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:33,197 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:33,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 15:39:33,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:33,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1840835883, now seen corresponding path program 1 times [2024-10-24 15:39:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:33,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259460365] [2024-10-24 15:39:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:33,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:33,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259460365] [2024-10-24 15:39:33,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259460365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:33,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:33,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508055325] [2024-10-24 15:39:33,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:33,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:33,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:33,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:33,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 171 [2024-10-24 15:39:33,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 189 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:33,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:33,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 171 [2024-10-24 15:39:33,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:34,178 INFO L124 PetriNetUnfolderBase]: 2252/9078 cut-off events. [2024-10-24 15:39:34,179 INFO L125 PetriNetUnfolderBase]: For 872/1784 co-relation queries the response was YES. [2024-10-24 15:39:34,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14598 conditions, 9078 events. 2252/9078 cut-off events. For 872/1784 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 103441 event pairs, 1333 based on Foata normal form. 10/8087 useless extension candidates. Maximal degree in co-relation 14507. Up to 2161 conditions per place. [2024-10-24 15:39:34,221 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 33 selfloop transitions, 5 changer transitions 0/204 dead transitions. [2024-10-24 15:39:34,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 204 transitions, 623 flow [2024-10-24 15:39:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-10-24 15:39:34,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-10-24 15:39:34,223 INFO L175 Difference]: Start difference. First operand has 178 places, 189 transitions, 512 flow. Second operand 3 states and 474 transitions. [2024-10-24 15:39:34,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 204 transitions, 623 flow [2024-10-24 15:39:34,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 204 transitions, 621 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:39:34,227 INFO L231 Difference]: Finished difference. Result has 181 places, 193 transitions, 548 flow [2024-10-24 15:39:34,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=181, PETRI_TRANSITIONS=193} [2024-10-24 15:39:34,227 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2024-10-24 15:39:34,227 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 193 transitions, 548 flow [2024-10-24 15:39:34,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:34,228 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:34,228 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:34,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 15:39:34,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:34,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:34,229 INFO L85 PathProgramCache]: Analyzing trace with hash 832986920, now seen corresponding path program 1 times [2024-10-24 15:39:34,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:34,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848911827] [2024-10-24 15:39:34,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:34,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:39:34,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:34,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848911827] [2024-10-24 15:39:34,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848911827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:34,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:34,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:34,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111246207] [2024-10-24 15:39:34,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:34,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:34,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:34,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:34,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:34,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 171 [2024-10-24 15:39:34,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 193 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:34,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:34,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 171 [2024-10-24 15:39:34,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:35,008 INFO L124 PetriNetUnfolderBase]: 2197/9515 cut-off events. [2024-10-24 15:39:35,009 INFO L125 PetriNetUnfolderBase]: For 1505/2497 co-relation queries the response was YES. [2024-10-24 15:39:35,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15770 conditions, 9515 events. 2197/9515 cut-off events. For 1505/2497 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 110718 event pairs, 1245 based on Foata normal form. 9/8477 useless extension candidates. Maximal degree in co-relation 14042. Up to 1989 conditions per place. [2024-10-24 15:39:35,061 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 29 selfloop transitions, 6 changer transitions 0/205 dead transitions. [2024-10-24 15:39:35,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 205 transitions, 652 flow [2024-10-24 15:39:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-10-24 15:39:35,063 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-10-24 15:39:35,063 INFO L175 Difference]: Start difference. First operand has 181 places, 193 transitions, 548 flow. Second operand 3 states and 474 transitions. [2024-10-24 15:39:35,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 205 transitions, 652 flow [2024-10-24 15:39:35,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 205 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:35,068 INFO L231 Difference]: Finished difference. Result has 183 places, 197 transitions, 586 flow [2024-10-24 15:39:35,069 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=183, PETRI_TRANSITIONS=197} [2024-10-24 15:39:35,069 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 11 predicate places. [2024-10-24 15:39:35,069 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 197 transitions, 586 flow [2024-10-24 15:39:35,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:35,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:35,070 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:35,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 15:39:35,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:35,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:35,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1525444953, now seen corresponding path program 1 times [2024-10-24 15:39:35,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:35,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932678927] [2024-10-24 15:39:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:35,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:35,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932678927] [2024-10-24 15:39:35,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932678927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:35,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:35,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:35,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141634493] [2024-10-24 15:39:35,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:35,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:35,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:35,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:35,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:35,125 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2024-10-24 15:39:35,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 197 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:35,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:35,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2024-10-24 15:39:35,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:35,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][179], [171#true, Black: 191#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 175#true, 101#L695-7true, 194#true, Black: 196#(= |#race~data~0| 0), 199#true, Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 93#L712-1true, 173#true, 118#L695-2true, Black: 187#(<= (+ ~threads_alive~0 1) 0)]) [2024-10-24 15:39:35,962 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-10-24 15:39:35,962 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-24 15:39:35,963 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-24 15:39:35,963 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-24 15:39:36,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][73], [Black: 191#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 171#true, Black: 175#true, 194#true, Black: 196#(= |#race~data~0| 0), 199#true, Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 93#L712-1true, 45#L697true, 118#L695-2true, 173#true, Black: 187#(<= (+ ~threads_alive~0 1) 0)]) [2024-10-24 15:39:36,198 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-24 15:39:36,198 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-24 15:39:36,198 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-24 15:39:36,198 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-24 15:39:36,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][73], [171#true, Black: 191#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 175#true, 194#true, Black: 196#(= |#race~data~0| 0), Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 199#true, 169#L697-3true, 93#L712-1true, 173#true, Black: 187#(<= (+ ~threads_alive~0 1) 0), 118#L695-2true]) [2024-10-24 15:39:36,235 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2024-10-24 15:39:36,235 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-10-24 15:39:36,235 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-24 15:39:36,235 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-24 15:39:36,441 INFO L124 PetriNetUnfolderBase]: 4088/13922 cut-off events. [2024-10-24 15:39:36,442 INFO L125 PetriNetUnfolderBase]: For 5704/6121 co-relation queries the response was YES. [2024-10-24 15:39:36,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26415 conditions, 13922 events. 4088/13922 cut-off events. For 5704/6121 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 159201 event pairs, 2076 based on Foata normal form. 74/12634 useless extension candidates. Maximal degree in co-relation 23183. Up to 5203 conditions per place. [2024-10-24 15:39:36,499 INFO L140 encePairwiseOnDemand]: 162/171 looper letters, 49 selfloop transitions, 19 changer transitions 0/223 dead transitions. [2024-10-24 15:39:36,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 223 transitions, 823 flow [2024-10-24 15:39:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2024-10-24 15:39:36,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9142300194931774 [2024-10-24 15:39:36,501 INFO L175 Difference]: Start difference. First operand has 183 places, 197 transitions, 586 flow. Second operand 3 states and 469 transitions. [2024-10-24 15:39:36,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 223 transitions, 823 flow [2024-10-24 15:39:36,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 223 transitions, 811 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:36,509 INFO L231 Difference]: Finished difference. Result has 185 places, 212 transitions, 756 flow [2024-10-24 15:39:36,510 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=185, PETRI_TRANSITIONS=212} [2024-10-24 15:39:36,510 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 13 predicate places. [2024-10-24 15:39:36,510 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 212 transitions, 756 flow [2024-10-24 15:39:36,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:36,511 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:36,511 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:36,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 15:39:36,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:36,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:36,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1043883361, now seen corresponding path program 1 times [2024-10-24 15:39:36,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:36,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078121691] [2024-10-24 15:39:36,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:36,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:36,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:39:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:36,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:39:36,553 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:39:36,553 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2024-10-24 15:39:36,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-10-24 15:39:36,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-10-24 15:39:36,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-10-24 15:39:36,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-10-24 15:39:36,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2024-10-24 15:39:36,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-10-24 15:39:36,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-10-24 15:39:36,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-10-24 15:39:36,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-10-24 15:39:36,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-10-24 15:39:36,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-10-24 15:39:36,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-10-24 15:39:36,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-10-24 15:39:36,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 15:39:36,555 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:36,641 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-10-24 15:39:36,644 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-10-24 15:39:36,645 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-24 15:39:36,652 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-10-24 15:39:36,654 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 15:39:36,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:39:36 BasicIcfg [2024-10-24 15:39:36,659 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 15:39:36,660 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 15:39:36,660 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 15:39:36,661 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 15:39:36,661 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:28" (3/4) ... [2024-10-24 15:39:36,662 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 15:39:36,663 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 15:39:36,664 INFO L158 Benchmark]: Toolchain (without parser) took 8907.12ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 82.6MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 446.6MB. Max. memory is 16.1GB. [2024-10-24 15:39:36,664 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:39:36,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.19ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 82.5MB in the beginning and 174.4MB in the end (delta: -91.9MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-10-24 15:39:36,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.76ms. Allocated memory is still 211.8MB. Free memory was 174.4MB in the beginning and 172.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:39:36,665 INFO L158 Benchmark]: Boogie Preprocessor took 19.43ms. Allocated memory is still 211.8MB. Free memory was 172.3MB in the beginning and 171.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:39:36,665 INFO L158 Benchmark]: RCFGBuilder took 398.69ms. Allocated memory is still 211.8MB. Free memory was 171.3MB in the beginning and 150.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 15:39:36,665 INFO L158 Benchmark]: TraceAbstraction took 8022.12ms. Allocated memory was 211.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 150.3MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 456.5MB. Max. memory is 16.1GB. [2024-10-24 15:39:36,665 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 2.3GB. Free memory is still 1.8GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:39:36,667 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.19ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 82.5MB in the beginning and 174.4MB in the end (delta: -91.9MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.76ms. Allocated memory is still 211.8MB. Free memory was 174.4MB in the beginning and 172.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.43ms. Allocated memory is still 211.8MB. Free memory was 172.3MB in the beginning and 171.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 398.69ms. Allocated memory is still 211.8MB. Free memory was 171.3MB in the beginning and 150.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8022.12ms. Allocated memory was 211.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 150.3MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 456.5MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 2.3GB. Free memory is still 1.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 692]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = -1; VAL [threads_alive=-1] [L686] 0 pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [threads_alive=-1, threads_alive_mutex={1:0}] [L687] 0 pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; VAL [threads_alive=-1, threads_alive_mutex={1:0}] [L688] 0 int data = 0; VAL [data=0, threads_alive=-1, threads_alive_mutex={1:0}] [L689] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}] [L701] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L702] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}] [L702] RET 0 assume_abort_if_not(threads_total >= 0) [L703] 0 int i = 0; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L703] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={2:0}, i=0, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L705] 0 threads_alive++ VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L707] 0 pthread_t tid; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L708] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1, tid=-1] [L703] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L703] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L712] COND FALSE 0 !(\read(threads_alive)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L692] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L715] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L692] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [715] and C: data = __VERIFIER_nondet_int() [692] - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 168 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 269 IncrementalHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 46 mSDtfsCounter, 269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=498occurred in iteration=6, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 689 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 200 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 222 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 384 IncrementalHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 39 mSDtfsCounter, 384 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=756occurred in iteration=6, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 689 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 15:39:36,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE