./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-lit/sssc12_variant.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version fca748b1 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-lit/sssc12_variant.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 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 13:39:41,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 13:39:41,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-20 13:39:41,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 13:39:41,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 13:39:41,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 13:39:41,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 13:39:41,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 13:39:41,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 13:39:41,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 13:39:41,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 13:39:41,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 13:39:41,579 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 13:39:41,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 13:39:41,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 13:39:41,582 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 13:39:41,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 13:39:41,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 13:39:41,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 13:39:41,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 13:39:41,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 13:39:41,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 13:39:41,584 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-20 13:39:41,585 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 13:39:41,585 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 13:39:41,585 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 13:39:41,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 13:39:41,586 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 13:39:41,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 13:39:41,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 13:39:41,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 13:39:41,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:39:41,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 13:39:41,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 13:39:41,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 13:39:41,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 13:39:41,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 13:39:41,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 13:39:41,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 13:39:41,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 13:39:41,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 13:39:41,589 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 -> 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 [2024-11-20 13:39:41,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 13:39:41,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 13:39:41,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 13:39:41,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 13:39:41,875 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 13:39:41,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant.i [2024-11-20 13:39:43,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 13:39:43,558 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 13:39:43,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant.i [2024-11-20 13:39:43,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82560e390/776a22d3244d4e909cbee46934ad62dc/FLAG35c124799 [2024-11-20 13:39:43,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82560e390/776a22d3244d4e909cbee46934ad62dc [2024-11-20 13:39:43,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 13:39:43,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 13:39:43,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 13:39:43,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 13:39:43,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 13:39:43,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:39:43" (1/1) ... [2024-11-20 13:39:43,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b7febe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:43, skipping insertion in model container [2024-11-20 13:39:43,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:39:43" (1/1) ... [2024-11-20 13:39:43,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 13:39:44,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:39:44,361 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 13:39:44,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:39:44,476 INFO L204 MainTranslator]: Completed translation [2024-11-20 13:39:44,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44 WrapperNode [2024-11-20 13:39:44,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 13:39:44,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 13:39:44,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 13:39:44,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 13:39:44,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44" (1/1) ... [2024-11-20 13:39:44,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44" (1/1) ... [2024-11-20 13:39:44,532 INFO L138 Inliner]: procedures = 272, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2024-11-20 13:39:44,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 13:39:44,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 13:39:44,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 13:39:44,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 13:39:44,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44" (1/1) ... [2024-11-20 13:39:44,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44" (1/1) ... [2024-11-20 13:39:44,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44" (1/1) ... [2024-11-20 13:39:44,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44" (1/1) ... [2024-11-20 13:39:44,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44" (1/1) ... [2024-11-20 13:39:44,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44" (1/1) ... [2024-11-20 13:39:44,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44" (1/1) ... [2024-11-20 13:39:44,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44" (1/1) ... [2024-11-20 13:39:44,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 13:39:44,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 13:39:44,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 13:39:44,571 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 13:39:44,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44" (1/1) ... [2024-11-20 13:39:44,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:39:44,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:39:44,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 13:39:44,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 13:39:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2024-11-20 13:39:44,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2024-11-20 13:39:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 13:39:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 13:39:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 13:39:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 13:39:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 13:39:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 13:39:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 13:39:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 13:39:44,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 13:39:44,664 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 13:39:44,877 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 13:39:44,907 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 13:39:45,220 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 13:39:45,220 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 13:39:45,258 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 13:39:45,259 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 13:39:45,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:39:45 BoogieIcfgContainer [2024-11-20 13:39:45,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 13:39:45,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 13:39:45,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 13:39:45,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 13:39:45,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:39:43" (1/3) ... [2024-11-20 13:39:45,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20625715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:39:45, skipping insertion in model container [2024-11-20 13:39:45,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:44" (2/3) ... [2024-11-20 13:39:45,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20625715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:39:45, skipping insertion in model container [2024-11-20 13:39:45,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:39:45" (3/3) ... [2024-11-20 13:39:45,268 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2024-11-20 13:39:45,284 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 13:39:45,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-11-20 13:39:45,285 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 13:39:45,384 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 13:39:45,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 166 transitions, 336 flow [2024-11-20 13:39:45,498 INFO L124 PetriNetUnfolderBase]: 9/177 cut-off events. [2024-11-20 13:39:45,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:39:45,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 177 events. 9/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 143 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 98. Up to 4 conditions per place. [2024-11-20 13:39:45,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 166 transitions, 336 flow [2024-11-20 13:39:45,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 166 transitions, 336 flow [2024-11-20 13:39:45,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:39:45,526 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;@2f051a9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:39:45,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-11-20 13:39:45,533 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:39:45,533 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-20 13:39:45,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:39:45,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:45,534 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] [2024-11-20 13:39:45,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-20 13:39:45,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:45,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1268391239, now seen corresponding path program 1 times [2024-11-20 13:39:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:45,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604713740] [2024-11-20 13:39:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:45,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:45,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:45,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604713740] [2024-11-20 13:39:45,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604713740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:45,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:45,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:45,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083273867] [2024-11-20 13:39:45,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:45,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:45,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:45,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:45,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:45,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 166 [2024-11-20 13:39:45,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 166 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:45,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:45,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 166 [2024-11-20 13:39:45,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:45,935 INFO L124 PetriNetUnfolderBase]: 3/156 cut-off events. [2024-11-20 13:39:45,935 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 13:39:45,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 156 events. 3/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 12/147 useless extension candidates. Maximal degree in co-relation 92. Up to 11 conditions per place. [2024-11-20 13:39:45,938 INFO L140 encePairwiseOnDemand]: 157/166 looper letters, 10 selfloop transitions, 2 changer transitions 1/152 dead transitions. [2024-11-20 13:39:45,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 152 transitions, 332 flow [2024-11-20 13:39:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2024-11-20 13:39:45,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9116465863453815 [2024-11-20 13:39:45,958 INFO L175 Difference]: Start difference. First operand has 161 places, 166 transitions, 336 flow. Second operand 3 states and 454 transitions. [2024-11-20 13:39:45,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 152 transitions, 332 flow [2024-11-20 13:39:45,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 152 transitions, 332 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:39:45,970 INFO L231 Difference]: Finished difference. Result has 154 places, 151 transitions, 310 flow [2024-11-20 13:39:45,974 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=154, PETRI_TRANSITIONS=151} [2024-11-20 13:39:45,977 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, -7 predicate places. [2024-11-20 13:39:45,980 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 151 transitions, 310 flow [2024-11-20 13:39:45,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:45,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:45,981 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] [2024-11-20 13:39:45,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 13:39:45,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-20 13:39:45,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1403343425, now seen corresponding path program 1 times [2024-11-20 13:39:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:45,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092577181] [2024-11-20 13:39:45,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:45,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:46,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:46,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092577181] [2024-11-20 13:39:46,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092577181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:46,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:46,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:46,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811640852] [2024-11-20 13:39:46,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:46,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:46,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:46,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:46,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:46,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 166 [2024-11-20 13:39:46,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:46,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:46,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 166 [2024-11-20 13:39:46,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:46,241 INFO L124 PetriNetUnfolderBase]: 3/154 cut-off events. [2024-11-20 13:39:46,241 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 13:39:46,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 154 events. 3/154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 141. Up to 11 conditions per place. [2024-11-20 13:39:46,243 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 10 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2024-11-20 13:39:46,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 150 transitions, 332 flow [2024-11-20 13:39:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2024-11-20 13:39:46,250 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8995983935742972 [2024-11-20 13:39:46,250 INFO L175 Difference]: Start difference. First operand has 154 places, 151 transitions, 310 flow. Second operand 3 states and 448 transitions. [2024-11-20 13:39:46,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 150 transitions, 332 flow [2024-11-20 13:39:46,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 150 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:46,255 INFO L231 Difference]: Finished difference. Result has 152 places, 150 transitions, 308 flow [2024-11-20 13:39:46,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=152, PETRI_TRANSITIONS=150} [2024-11-20 13:39:46,256 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, -9 predicate places. [2024-11-20 13:39:46,256 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 150 transitions, 308 flow [2024-11-20 13:39:46,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:46,257 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:46,257 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] [2024-11-20 13:39:46,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 13:39:46,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-20 13:39:46,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2132856912, now seen corresponding path program 1 times [2024-11-20 13:39:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:46,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704595701] [2024-11-20 13:39:46,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:46,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:46,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:46,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704595701] [2024-11-20 13:39:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704595701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:46,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:46,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:46,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828675442] [2024-11-20 13:39:46,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:46,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:46,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:46,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:46,370 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 166 [2024-11-20 13:39:46,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 150 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:46,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:46,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 166 [2024-11-20 13:39:46,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:46,407 INFO L124 PetriNetUnfolderBase]: 3/150 cut-off events. [2024-11-20 13:39:46,407 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 13:39:46,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 150 events. 3/150 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 129. Up to 11 conditions per place. [2024-11-20 13:39:46,408 INFO L140 encePairwiseOnDemand]: 161/166 looper letters, 11 selfloop transitions, 1 changer transitions 0/146 dead transitions. [2024-11-20 13:39:46,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 324 flow [2024-11-20 13:39:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2024-11-20 13:39:46,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.893574297188755 [2024-11-20 13:39:46,411 INFO L175 Difference]: Start difference. First operand has 152 places, 150 transitions, 308 flow. Second operand 3 states and 445 transitions. [2024-11-20 13:39:46,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 324 flow [2024-11-20 13:39:46,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 146 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:46,414 INFO L231 Difference]: Finished difference. Result has 148 places, 146 transitions, 298 flow [2024-11-20 13:39:46,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=148, PETRI_TRANSITIONS=146} [2024-11-20 13:39:46,419 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, -13 predicate places. [2024-11-20 13:39:46,419 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 146 transitions, 298 flow [2024-11-20 13:39:46,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:46,419 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:46,420 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] [2024-11-20 13:39:46,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 13:39:46,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-20 13:39:46,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:46,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1413208963, now seen corresponding path program 1 times [2024-11-20 13:39:46,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:46,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267095932] [2024-11-20 13:39:46,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:46,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:46,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:46,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267095932] [2024-11-20 13:39:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267095932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:46,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:46,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:46,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022153861] [2024-11-20 13:39:46,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:46,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:46,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:46,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:46,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 166 [2024-11-20 13:39:46,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 298 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-11-20 13:39:46,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:46,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 166 [2024-11-20 13:39:46,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:46,563 INFO L124 PetriNetUnfolderBase]: 3/149 cut-off events. [2024-11-20 13:39:46,563 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 13:39:46,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 149 events. 3/149 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 126. Up to 10 conditions per place. [2024-11-20 13:39:46,565 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 9 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2024-11-20 13:39:46,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 145 transitions, 318 flow [2024-11-20 13:39:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2024-11-20 13:39:46,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9036144578313253 [2024-11-20 13:39:46,569 INFO L175 Difference]: Start difference. First operand has 148 places, 146 transitions, 298 flow. Second operand 3 states and 450 transitions. [2024-11-20 13:39:46,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 145 transitions, 318 flow [2024-11-20 13:39:46,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:39:46,573 INFO L231 Difference]: Finished difference. Result has 148 places, 145 transitions, 299 flow [2024-11-20 13:39:46,574 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=148, PETRI_TRANSITIONS=145} [2024-11-20 13:39:46,578 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, -13 predicate places. [2024-11-20 13:39:46,578 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 299 flow [2024-11-20 13:39:46,579 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-11-20 13:39:46,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:46,579 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-20 13:39:46,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 13:39:46,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-20 13:39:46,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1580768593, now seen corresponding path program 1 times [2024-11-20 13:39:46,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:46,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333007743] [2024-11-20 13:39:46,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:46,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 13:39:46,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:46,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333007743] [2024-11-20 13:39:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333007743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:46,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:39:46,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044098937] [2024-11-20 13:39:46,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:46,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 13:39:46,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:46,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 13:39:46,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 13:39:46,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 166 [2024-11-20 13:39:46,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 145 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:46,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:46,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 166 [2024-11-20 13:39:46,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:46,846 INFO L124 PetriNetUnfolderBase]: 2/152 cut-off events. [2024-11-20 13:39:46,846 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 13:39:46,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 152 events. 2/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 1/139 useless extension candidates. Maximal degree in co-relation 138. Up to 15 conditions per place. [2024-11-20 13:39:46,847 INFO L140 encePairwiseOnDemand]: 162/166 looper letters, 14 selfloop transitions, 0 changer transitions 4/148 dead transitions. [2024-11-20 13:39:46,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 148 transitions, 341 flow [2024-11-20 13:39:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 13:39:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 13:39:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 729 transitions. [2024-11-20 13:39:46,850 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8783132530120482 [2024-11-20 13:39:46,850 INFO L175 Difference]: Start difference. First operand has 148 places, 145 transitions, 299 flow. Second operand 5 states and 729 transitions. [2024-11-20 13:39:46,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 148 transitions, 341 flow [2024-11-20 13:39:46,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 148 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:46,854 INFO L231 Difference]: Finished difference. Result has 153 places, 144 transitions, 299 flow [2024-11-20 13:39:46,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=153, PETRI_TRANSITIONS=144} [2024-11-20 13:39:46,857 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, -8 predicate places. [2024-11-20 13:39:46,857 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 144 transitions, 299 flow [2024-11-20 13:39:46,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:46,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:46,858 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-20 13:39:46,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 13:39:46,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-20 13:39:46,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1178884539, now seen corresponding path program 1 times [2024-11-20 13:39:46,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:46,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570851304] [2024-11-20 13:39:46,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:46,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 13:39:46,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 13:39:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 13:39:46,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 13:39:46,967 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 13:39:46,969 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2024-11-20 13:39:46,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2024-11-20 13:39:46,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2024-11-20 13:39:46,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2024-11-20 13:39:46,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2024-11-20 13:39:46,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2024-11-20 13:39:46,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2024-11-20 13:39:46,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2024-11-20 13:39:46,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2024-11-20 13:39:46,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2024-11-20 13:39:46,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2024-11-20 13:39:46,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2024-11-20 13:39:46,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2024-11-20 13:39:46,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2024-11-20 13:39:46,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2024-11-20 13:39:46,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2024-11-20 13:39:46,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2024-11-20 13:39:46,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2024-11-20 13:39:46,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2024-11-20 13:39:46,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2024-11-20 13:39:46,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2024-11-20 13:39:46,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2024-11-20 13:39:46,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2024-11-20 13:39:46,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2024-11-20 13:39:46,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2024-11-20 13:39:46,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2024-11-20 13:39:46,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2024-11-20 13:39:46,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2024-11-20 13:39:46,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2024-11-20 13:39:46,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 13:39:46,982 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 13:39:46,984 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 13:39:46,985 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-20 13:39:47,047 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 13:39:47,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 252 transitions, 514 flow [2024-11-20 13:39:47,108 INFO L124 PetriNetUnfolderBase]: 15/276 cut-off events. [2024-11-20 13:39:47,109 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 13:39:47,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 276 events. 15/276 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 183. Up to 6 conditions per place. [2024-11-20 13:39:47,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 252 transitions, 514 flow [2024-11-20 13:39:47,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 252 transitions, 514 flow [2024-11-20 13:39:47,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:39:47,119 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;@2f051a9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:39:47,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2024-11-20 13:39:47,122 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:39:47,122 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-20 13:39:47,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:39:47,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:47,123 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] [2024-11-20 13:39:47,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-11-20 13:39:47,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:47,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1569155509, now seen corresponding path program 1 times [2024-11-20 13:39:47,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:47,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803306285] [2024-11-20 13:39:47,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:47,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:47,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:47,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803306285] [2024-11-20 13:39:47,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803306285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:47,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:47,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:47,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061977458] [2024-11-20 13:39:47,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:47,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:47,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:47,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:47,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:47,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 252 [2024-11-20 13:39:47,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 252 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:47,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:47,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 252 [2024-11-20 13:39:47,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:47,345 INFO L124 PetriNetUnfolderBase]: 61/810 cut-off events. [2024-11-20 13:39:47,346 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-20 13:39:47,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 810 events. 61/810 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4573 event pairs, 42 based on Foata normal form. 91/768 useless extension candidates. Maximal degree in co-relation 736. Up to 102 conditions per place. [2024-11-20 13:39:47,354 INFO L140 encePairwiseOnDemand]: 240/252 looper letters, 17 selfloop transitions, 2 changer transitions 1/233 dead transitions. [2024-11-20 13:39:47,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 233 transitions, 514 flow [2024-11-20 13:39:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2024-11-20 13:39:47,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9113756613756614 [2024-11-20 13:39:47,357 INFO L175 Difference]: Start difference. First operand has 244 places, 252 transitions, 514 flow. Second operand 3 states and 689 transitions. [2024-11-20 13:39:47,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 233 transitions, 514 flow [2024-11-20 13:39:47,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 233 transitions, 514 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:39:47,361 INFO L231 Difference]: Finished difference. Result has 235 places, 232 transitions, 478 flow [2024-11-20 13:39:47,362 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=235, PETRI_TRANSITIONS=232} [2024-11-20 13:39:47,363 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -9 predicate places. [2024-11-20 13:39:47,363 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 232 transitions, 478 flow [2024-11-20 13:39:47,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:47,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:47,364 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] [2024-11-20 13:39:47,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 13:39:47,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-11-20 13:39:47,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1099319873, now seen corresponding path program 1 times [2024-11-20 13:39:47,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:47,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641409991] [2024-11-20 13:39:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:47,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:47,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:47,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641409991] [2024-11-20 13:39:47,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641409991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:47,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:47,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:47,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018301527] [2024-11-20 13:39:47,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:47,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:47,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:47,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:47,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:47,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 252 [2024-11-20 13:39:47,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 232 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:47,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:47,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 252 [2024-11-20 13:39:47,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:47,537 INFO L124 PetriNetUnfolderBase]: 25/553 cut-off events. [2024-11-20 13:39:47,538 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-20 13:39:47,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 553 events. 25/553 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2463 event pairs, 12 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 580. Up to 39 conditions per place. [2024-11-20 13:39:47,542 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 14 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2024-11-20 13:39:47,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 231 transitions, 508 flow [2024-11-20 13:39:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:47,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:47,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2024-11-20 13:39:47,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9074074074074074 [2024-11-20 13:39:47,548 INFO L175 Difference]: Start difference. First operand has 235 places, 232 transitions, 478 flow. Second operand 3 states and 686 transitions. [2024-11-20 13:39:47,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 231 transitions, 508 flow [2024-11-20 13:39:47,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 231 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:47,552 INFO L231 Difference]: Finished difference. Result has 233 places, 231 transitions, 476 flow [2024-11-20 13:39:47,552 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=233, PETRI_TRANSITIONS=231} [2024-11-20 13:39:47,552 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -11 predicate places. [2024-11-20 13:39:47,552 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 231 transitions, 476 flow [2024-11-20 13:39:47,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:47,553 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:47,553 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] [2024-11-20 13:39:47,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 13:39:47,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-11-20 13:39:47,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash 637175472, now seen corresponding path program 1 times [2024-11-20 13:39:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:47,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067736202] [2024-11-20 13:39:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:47,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:47,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:47,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067736202] [2024-11-20 13:39:47,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067736202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:47,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:47,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:47,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10551720] [2024-11-20 13:39:47,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:47,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:47,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:47,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:47,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:47,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 252 [2024-11-20 13:39:47,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 231 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:47,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:47,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 252 [2024-11-20 13:39:47,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:47,682 INFO L124 PetriNetUnfolderBase]: 39/750 cut-off events. [2024-11-20 13:39:47,682 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-20 13:39:47,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 750 events. 39/750 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4164 event pairs, 20 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 789. Up to 56 conditions per place. [2024-11-20 13:39:47,687 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 16 selfloop transitions, 1 changer transitions 0/226 dead transitions. [2024-11-20 13:39:47,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 226 transitions, 500 flow [2024-11-20 13:39:47,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-11-20 13:39:47,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8981481481481481 [2024-11-20 13:39:47,690 INFO L175 Difference]: Start difference. First operand has 233 places, 231 transitions, 476 flow. Second operand 3 states and 679 transitions. [2024-11-20 13:39:47,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 226 transitions, 500 flow [2024-11-20 13:39:47,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 226 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:47,694 INFO L231 Difference]: Finished difference. Result has 228 places, 226 transitions, 464 flow [2024-11-20 13:39:47,694 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=228, PETRI_TRANSITIONS=226} [2024-11-20 13:39:47,695 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -16 predicate places. [2024-11-20 13:39:47,695 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 464 flow [2024-11-20 13:39:47,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:47,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:47,696 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] [2024-11-20 13:39:47,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 13:39:47,696 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-11-20 13:39:47,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:47,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1559604867, now seen corresponding path program 1 times [2024-11-20 13:39:47,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:47,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108932254] [2024-11-20 13:39:47,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:47,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:47,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108932254] [2024-11-20 13:39:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108932254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:47,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:47,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211954633] [2024-11-20 13:39:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:47,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:47,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:47,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:47,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 252 [2024-11-20 13:39:47,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 226 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:47,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:47,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 252 [2024-11-20 13:39:47,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:47,847 INFO L124 PetriNetUnfolderBase]: 47/709 cut-off events. [2024-11-20 13:39:47,848 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-20 13:39:47,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 709 events. 47/709 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3547 event pairs, 30 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 770. Up to 76 conditions per place. [2024-11-20 13:39:47,853 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 15 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2024-11-20 13:39:47,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 225 transitions, 496 flow [2024-11-20 13:39:47,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 684 transitions. [2024-11-20 13:39:47,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-20 13:39:47,856 INFO L175 Difference]: Start difference. First operand has 228 places, 226 transitions, 464 flow. Second operand 3 states and 684 transitions. [2024-11-20 13:39:47,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 225 transitions, 496 flow [2024-11-20 13:39:47,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 225 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:39:47,860 INFO L231 Difference]: Finished difference. Result has 228 places, 225 transitions, 465 flow [2024-11-20 13:39:47,860 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=465, PETRI_PLACES=228, PETRI_TRANSITIONS=225} [2024-11-20 13:39:47,861 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -16 predicate places. [2024-11-20 13:39:47,861 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 225 transitions, 465 flow [2024-11-20 13:39:47,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:47,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:47,862 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] [2024-11-20 13:39:47,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 13:39:47,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-11-20 13:39:47,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:47,863 INFO L85 PathProgramCache]: Analyzing trace with hash 10352380, now seen corresponding path program 1 times [2024-11-20 13:39:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:47,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727894288] [2024-11-20 13:39:47,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:47,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:47,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727894288] [2024-11-20 13:39:47,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727894288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:47,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:47,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:47,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908964869] [2024-11-20 13:39:47,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:47,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:47,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:47,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:47,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 252 [2024-11-20 13:39:47,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 225 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:47,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:47,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 252 [2024-11-20 13:39:47,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:48,211 INFO L124 PetriNetUnfolderBase]: 164/2096 cut-off events. [2024-11-20 13:39:48,211 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-20 13:39:48,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2426 conditions, 2096 events. 164/2096 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 17325 event pairs, 57 based on Foata normal form. 0/1792 useless extension candidates. Maximal degree in co-relation 2384. Up to 204 conditions per place. [2024-11-20 13:39:48,229 INFO L140 encePairwiseOnDemand]: 232/252 looper letters, 32 selfloop transitions, 14 changer transitions 0/244 dead transitions. [2024-11-20 13:39:48,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 244 transitions, 600 flow [2024-11-20 13:39:48,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2024-11-20 13:39:48,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.917989417989418 [2024-11-20 13:39:48,233 INFO L175 Difference]: Start difference. First operand has 228 places, 225 transitions, 465 flow. Second operand 3 states and 694 transitions. [2024-11-20 13:39:48,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 244 transitions, 600 flow [2024-11-20 13:39:48,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 244 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:48,238 INFO L231 Difference]: Finished difference. Result has 230 places, 239 transitions, 585 flow [2024-11-20 13:39:48,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=585, PETRI_PLACES=230, PETRI_TRANSITIONS=239} [2024-11-20 13:39:48,240 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -14 predicate places. [2024-11-20 13:39:48,240 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 239 transitions, 585 flow [2024-11-20 13:39:48,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:48,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:48,241 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:39:48,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 13:39:48,241 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-11-20 13:39:48,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:48,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1324832269, now seen corresponding path program 1 times [2024-11-20 13:39:48,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:48,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872333296] [2024-11-20 13:39:48,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:48,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-20 13:39:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:48,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872333296] [2024-11-20 13:39:48,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872333296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:48,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:48,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:39:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27142430] [2024-11-20 13:39:48,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:48,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 13:39:48,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:48,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 13:39:48,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 13:39:48,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 252 [2024-11-20 13:39:48,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 239 transitions, 585 flow. Second operand has 5 states, 5 states have (on average 223.4) internal successors, (1117), 5 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:48,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:48,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 252 [2024-11-20 13:39:48,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:48,651 INFO L124 PetriNetUnfolderBase]: 99/1993 cut-off events. [2024-11-20 13:39:48,651 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-11-20 13:39:48,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 1993 events. 99/1993 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 16303 event pairs, 41 based on Foata normal form. 1/1705 useless extension candidates. Maximal degree in co-relation 2223. Up to 120 conditions per place. [2024-11-20 13:39:48,670 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 17 selfloop transitions, 0 changer transitions 4/242 dead transitions. [2024-11-20 13:39:48,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 242 transitions, 633 flow [2024-11-20 13:39:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 13:39:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 13:39:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1127 transitions. [2024-11-20 13:39:48,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944444444444445 [2024-11-20 13:39:48,674 INFO L175 Difference]: Start difference. First operand has 230 places, 239 transitions, 585 flow. Second operand 5 states and 1127 transitions. [2024-11-20 13:39:48,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 242 transitions, 633 flow [2024-11-20 13:39:48,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 242 transitions, 605 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:48,682 INFO L231 Difference]: Finished difference. Result has 235 places, 238 transitions, 561 flow [2024-11-20 13:39:48,683 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=561, PETRI_PLACES=235, PETRI_TRANSITIONS=238} [2024-11-20 13:39:48,684 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -9 predicate places. [2024-11-20 13:39:48,684 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 238 transitions, 561 flow [2024-11-20 13:39:48,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 223.4) internal successors, (1117), 5 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:48,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:48,686 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2024-11-20 13:39:48,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 13:39:48,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-11-20 13:39:48,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:48,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1086016417, now seen corresponding path program 1 times [2024-11-20 13:39:48,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:48,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535166033] [2024-11-20 13:39:48,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:48,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 13:39:48,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 13:39:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 13:39:48,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 13:39:48,736 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 13:39:48,736 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2024-11-20 13:39:48,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2024-11-20 13:39:48,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2024-11-20 13:39:48,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2024-11-20 13:39:48,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2024-11-20 13:39:48,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2024-11-20 13:39:48,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2024-11-20 13:39:48,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2024-11-20 13:39:48,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2024-11-20 13:39:48,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2024-11-20 13:39:48,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2024-11-20 13:39:48,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2024-11-20 13:39:48,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2024-11-20 13:39:48,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2024-11-20 13:39:48,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2024-11-20 13:39:48,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2024-11-20 13:39:48,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2024-11-20 13:39:48,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2024-11-20 13:39:48,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2024-11-20 13:39:48,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2024-11-20 13:39:48,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2024-11-20 13:39:48,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2024-11-20 13:39:48,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2024-11-20 13:39:48,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2024-11-20 13:39:48,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2024-11-20 13:39:48,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2024-11-20 13:39:48,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2024-11-20 13:39:48,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2024-11-20 13:39:48,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2024-11-20 13:39:48,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2024-11-20 13:39:48,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2024-11-20 13:39:48,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2024-11-20 13:39:48,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2024-11-20 13:39:48,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2024-11-20 13:39:48,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2024-11-20 13:39:48,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2024-11-20 13:39:48,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2024-11-20 13:39:48,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2024-11-20 13:39:48,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2024-11-20 13:39:48,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2024-11-20 13:39:48,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 13:39:48,743 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:39:48,745 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 13:39:48,746 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-20 13:39:48,808 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 13:39:48,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 338 transitions, 694 flow [2024-11-20 13:39:48,878 INFO L124 PetriNetUnfolderBase]: 21/375 cut-off events. [2024-11-20 13:39:48,878 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-20 13:39:48,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 375 events. 21/375 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1016 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 280. Up to 8 conditions per place. [2024-11-20 13:39:48,882 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 338 transitions, 694 flow [2024-11-20 13:39:48,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 327 places, 338 transitions, 694 flow [2024-11-20 13:39:48,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:39:48,889 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;@2f051a9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:39:48,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-20 13:39:48,892 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:39:48,892 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-20 13:39:48,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:39:48,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:48,893 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] [2024-11-20 13:39:48,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-20 13:39:48,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:48,893 INFO L85 PathProgramCache]: Analyzing trace with hash 773320711, now seen corresponding path program 1 times [2024-11-20 13:39:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:48,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942086738] [2024-11-20 13:39:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:48,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:48,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:48,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942086738] [2024-11-20 13:39:48,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942086738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:48,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:48,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:48,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620784513] [2024-11-20 13:39:48,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:48,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:48,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:48,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:48,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:48,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 338 [2024-11-20 13:39:48,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 338 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:48,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:48,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 338 [2024-11-20 13:39:48,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:49,804 INFO L124 PetriNetUnfolderBase]: 763/5685 cut-off events. [2024-11-20 13:39:49,804 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2024-11-20 13:39:49,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6943 conditions, 5685 events. 763/5685 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 60119 event pairs, 630 based on Foata normal form. 701/5455 useless extension candidates. Maximal degree in co-relation 5718. Up to 1033 conditions per place. [2024-11-20 13:39:49,864 INFO L140 encePairwiseOnDemand]: 323/338 looper letters, 24 selfloop transitions, 2 changer transitions 1/314 dead transitions. [2024-11-20 13:39:49,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 314 transitions, 698 flow [2024-11-20 13:39:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-11-20 13:39:49,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9112426035502958 [2024-11-20 13:39:49,867 INFO L175 Difference]: Start difference. First operand has 327 places, 338 transitions, 694 flow. Second operand 3 states and 924 transitions. [2024-11-20 13:39:49,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 314 transitions, 698 flow [2024-11-20 13:39:49,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 314 transitions, 696 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-20 13:39:49,873 INFO L231 Difference]: Finished difference. Result has 316 places, 313 transitions, 646 flow [2024-11-20 13:39:49,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=316, PETRI_TRANSITIONS=313} [2024-11-20 13:39:49,874 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -11 predicate places. [2024-11-20 13:39:49,874 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 313 transitions, 646 flow [2024-11-20 13:39:49,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:49,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:49,875 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] [2024-11-20 13:39:49,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 13:39:49,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-20 13:39:49,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash -24285631, now seen corresponding path program 1 times [2024-11-20 13:39:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:49,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042905302] [2024-11-20 13:39:49,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:49,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:49,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042905302] [2024-11-20 13:39:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042905302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:49,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:49,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723251350] [2024-11-20 13:39:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:49,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:49,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:49,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 338 [2024-11-20 13:39:49,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 313 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:49,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:49,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 338 [2024-11-20 13:39:49,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:50,345 INFO L124 PetriNetUnfolderBase]: 163/2236 cut-off events. [2024-11-20 13:39:50,345 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-11-20 13:39:50,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 2236 events. 163/2236 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 18949 event pairs, 108 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 2471. Up to 199 conditions per place. [2024-11-20 13:39:50,376 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 18 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2024-11-20 13:39:50,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 312 transitions, 684 flow [2024-11-20 13:39:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-11-20 13:39:50,379 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9112426035502958 [2024-11-20 13:39:50,379 INFO L175 Difference]: Start difference. First operand has 316 places, 313 transitions, 646 flow. Second operand 3 states and 924 transitions. [2024-11-20 13:39:50,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 312 transitions, 684 flow [2024-11-20 13:39:50,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 312 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:50,385 INFO L231 Difference]: Finished difference. Result has 314 places, 312 transitions, 644 flow [2024-11-20 13:39:50,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=314, PETRI_TRANSITIONS=312} [2024-11-20 13:39:50,386 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -13 predicate places. [2024-11-20 13:39:50,386 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 312 transitions, 644 flow [2024-11-20 13:39:50,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:50,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:50,387 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] [2024-11-20 13:39:50,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 13:39:50,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-20 13:39:50,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:50,388 INFO L85 PathProgramCache]: Analyzing trace with hash 57569072, now seen corresponding path program 1 times [2024-11-20 13:39:50,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:50,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808661896] [2024-11-20 13:39:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:50,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:50,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808661896] [2024-11-20 13:39:50,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808661896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:50,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:50,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495701108] [2024-11-20 13:39:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:50,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:50,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:50,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:50,437 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 338 [2024-11-20 13:39:50,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 312 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:50,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:50,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 338 [2024-11-20 13:39:50,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:51,087 INFO L124 PetriNetUnfolderBase]: 325/4000 cut-off events. [2024-11-20 13:39:51,088 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-11-20 13:39:51,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 4000 events. 325/4000 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 40765 event pairs, 220 based on Foata normal form. 0/3343 useless extension candidates. Maximal degree in co-relation 4439. Up to 381 conditions per place. [2024-11-20 13:39:51,141 INFO L140 encePairwiseOnDemand]: 331/338 looper letters, 21 selfloop transitions, 1 changer transitions 0/306 dead transitions. [2024-11-20 13:39:51,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 306 transitions, 676 flow [2024-11-20 13:39:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2024-11-20 13:39:51,144 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9003944773175543 [2024-11-20 13:39:51,144 INFO L175 Difference]: Start difference. First operand has 314 places, 312 transitions, 644 flow. Second operand 3 states and 913 transitions. [2024-11-20 13:39:51,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 306 transitions, 676 flow [2024-11-20 13:39:51,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 306 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:51,150 INFO L231 Difference]: Finished difference. Result has 308 places, 306 transitions, 630 flow [2024-11-20 13:39:51,150 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=308, PETRI_TRANSITIONS=306} [2024-11-20 13:39:51,151 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -19 predicate places. [2024-11-20 13:39:51,151 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 306 transitions, 630 flow [2024-11-20 13:39:51,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:51,152 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:51,152 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] [2024-11-20 13:39:51,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 13:39:51,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-20 13:39:51,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash 767437059, now seen corresponding path program 1 times [2024-11-20 13:39:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:51,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625585357] [2024-11-20 13:39:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:51,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:51,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:51,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625585357] [2024-11-20 13:39:51,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625585357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:51,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:51,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:51,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776332788] [2024-11-20 13:39:51,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:51,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:51,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:51,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:51,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:51,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 338 [2024-11-20 13:39:51,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 306 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:51,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:51,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 338 [2024-11-20 13:39:51,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:51,746 INFO L124 PetriNetUnfolderBase]: 493/4263 cut-off events. [2024-11-20 13:39:51,747 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-11-20 13:39:51,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 4263 events. 493/4263 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 40930 event pairs, 390 based on Foata normal form. 0/3578 useless extension candidates. Maximal degree in co-relation 5008. Up to 652 conditions per place. [2024-11-20 13:39:51,797 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 21 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2024-11-20 13:39:51,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 305 transitions, 674 flow [2024-11-20 13:39:51,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions. [2024-11-20 13:39:51,800 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9053254437869822 [2024-11-20 13:39:51,800 INFO L175 Difference]: Start difference. First operand has 308 places, 306 transitions, 630 flow. Second operand 3 states and 918 transitions. [2024-11-20 13:39:51,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 305 transitions, 674 flow [2024-11-20 13:39:51,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 305 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:39:51,805 INFO L231 Difference]: Finished difference. Result has 308 places, 305 transitions, 631 flow [2024-11-20 13:39:51,806 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=308, PETRI_TRANSITIONS=305} [2024-11-20 13:39:51,806 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -19 predicate places. [2024-11-20 13:39:51,806 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 305 transitions, 631 flow [2024-11-20 13:39:51,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:51,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:51,807 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] [2024-11-20 13:39:51,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 13:39:51,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-20 13:39:51,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1159103246, now seen corresponding path program 1 times [2024-11-20 13:39:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:51,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452414305] [2024-11-20 13:39:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:51,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:51,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452414305] [2024-11-20 13:39:51,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452414305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:51,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:51,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:51,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033876316] [2024-11-20 13:39:51,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:51,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:51,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:51,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:51,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:51,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 338 [2024-11-20 13:39:51,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 305 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:51,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:51,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 338 [2024-11-20 13:39:51,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:55,340 INFO L124 PetriNetUnfolderBase]: 4201/31332 cut-off events. [2024-11-20 13:39:55,340 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2024-11-20 13:39:55,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37791 conditions, 31332 events. 4201/31332 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 462096 event pairs, 1667 based on Foata normal form. 0/26532 useless extension candidates. Maximal degree in co-relation 37748. Up to 4132 conditions per place. [2024-11-20 13:39:55,610 INFO L140 encePairwiseOnDemand]: 308/338 looper letters, 48 selfloop transitions, 21 changer transitions 0/334 dead transitions. [2024-11-20 13:39:55,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 334 transitions, 837 flow [2024-11-20 13:39:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 927 transitions. [2024-11-20 13:39:55,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9142011834319527 [2024-11-20 13:39:55,614 INFO L175 Difference]: Start difference. First operand has 308 places, 305 transitions, 631 flow. Second operand 3 states and 927 transitions. [2024-11-20 13:39:55,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 334 transitions, 837 flow [2024-11-20 13:39:55,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 334 transitions, 833 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:55,620 INFO L231 Difference]: Finished difference. Result has 310 places, 326 transitions, 813 flow [2024-11-20 13:39:55,621 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=310, PETRI_TRANSITIONS=326} [2024-11-20 13:39:55,622 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -17 predicate places. [2024-11-20 13:39:55,622 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 326 transitions, 813 flow [2024-11-20 13:39:55,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:55,622 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:55,623 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:39:55,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 13:39:55,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-20 13:39:55,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:55,623 INFO L85 PathProgramCache]: Analyzing trace with hash 16886909, now seen corresponding path program 1 times [2024-11-20 13:39:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:55,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160502310] [2024-11-20 13:39:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:39:55,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:55,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160502310] [2024-11-20 13:39:55,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160502310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:55,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:55,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 13:39:55,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044447069] [2024-11-20 13:39:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:55,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 13:39:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:55,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 13:39:55,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 13:39:55,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 338 [2024-11-20 13:39:55,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 326 transitions, 813 flow. Second operand has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:39:55,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:55,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 338 [2024-11-20 13:39:55,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:57,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [326#true, 338#(= |#race~len~0| 0), 324#true, 347#true, 110#L1043-3true, Black: 342#true, 328#true, 344#(= |#race~next~0| 0), 155#L1045-2true, 270#L1045-2true, 92#L1061-4true]) [2024-11-20 13:39:57,304 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-11-20 13:39:57,304 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-11-20 13:39:57,304 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-20 13:39:57,304 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-20 13:39:58,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [326#true, 338#(= |#race~len~0| 0), 324#true, 347#true, 110#L1043-3true, Black: 344#(= |#race~next~0| 0), 328#true, 155#L1045-2true, 270#L1045-2true, 92#L1061-4true, 342#true]) [2024-11-20 13:39:58,336 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-11-20 13:39:58,336 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-20 13:39:58,336 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-20 13:39:58,336 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-20 13:39:58,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [326#true, 338#(= |#race~len~0| 0), 324#true, 347#true, Black: 344#(= |#race~next~0| 0), 328#true, 284#L1043-1true, 155#L1045-2true, 270#L1045-2true, 92#L1061-4true, 342#true]) [2024-11-20 13:39:58,347 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-11-20 13:39:58,347 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-20 13:39:58,347 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-20 13:39:58,347 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-20 13:39:58,404 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1156] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [326#true, 338#(= |#race~len~0| 0), 324#true, 347#true, 110#L1043-3true, Black: 344#(= |#race~next~0| 0), 328#true, 155#L1045-2true, 270#L1045-2true, 92#L1061-4true, 342#true]) [2024-11-20 13:39:58,405 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-11-20 13:39:58,405 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-20 13:39:58,405 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-20 13:39:58,405 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-20 13:39:58,405 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-20 13:39:58,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [326#true, 338#(= |#race~len~0| 0), 324#true, 347#true, Black: 344#(= |#race~next~0| 0), 328#true, 155#L1045-2true, 216#L1043-2true, 270#L1045-2true, 92#L1061-4true, 342#true]) [2024-11-20 13:39:58,405 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2024-11-20 13:39:58,405 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-20 13:39:58,405 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-20 13:39:58,405 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-11-20 13:40:00,070 INFO L124 PetriNetUnfolderBase]: 3431/36137 cut-off events. [2024-11-20 13:40:00,070 INFO L125 PetriNetUnfolderBase]: For 1029/1059 co-relation queries the response was YES. [2024-11-20 13:40:00,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43394 conditions, 36137 events. 3431/36137 cut-off events. For 1029/1059 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 561709 event pairs, 1656 based on Foata normal form. 59/30940 useless extension candidates. Maximal degree in co-relation 43351. Up to 3075 conditions per place. [2024-11-20 13:40:00,420 INFO L140 encePairwiseOnDemand]: 334/338 looper letters, 27 selfloop transitions, 3 changer transitions 0/339 dead transitions. [2024-11-20 13:40:00,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 339 transitions, 919 flow [2024-11-20 13:40:00,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 13:40:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 13:40:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1255 transitions. [2024-11-20 13:40:00,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9282544378698225 [2024-11-20 13:40:00,425 INFO L175 Difference]: Start difference. First operand has 310 places, 326 transitions, 813 flow. Second operand 4 states and 1255 transitions. [2024-11-20 13:40:00,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 339 transitions, 919 flow [2024-11-20 13:40:00,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 339 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:40:00,460 INFO L231 Difference]: Finished difference. Result has 312 places, 326 transitions, 781 flow [2024-11-20 13:40:00,461 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=781, PETRI_PLACES=312, PETRI_TRANSITIONS=326} [2024-11-20 13:40:00,461 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -15 predicate places. [2024-11-20 13:40:00,461 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 326 transitions, 781 flow [2024-11-20 13:40:00,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:40:00,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:40:00,462 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:40:00,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 13:40:00,462 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-20 13:40:00,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:40:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash -201069650, now seen corresponding path program 1 times [2024-11-20 13:40:00,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:40:00,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55151969] [2024-11-20 13:40:00,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:40:00,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:40:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:40:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-20 13:40:00,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:40:00,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55151969] [2024-11-20 13:40:00,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55151969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:40:00,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:40:00,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:40:00,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563411207] [2024-11-20 13:40:00,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:40:00,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 13:40:00,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:40:00,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 13:40:00,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 13:40:00,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 338 [2024-11-20 13:40:00,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 326 transitions, 781 flow. Second operand has 5 states, 5 states have (on average 302.6) internal successors, (1513), 5 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:40:00,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:40:00,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 338 [2024-11-20 13:40:00,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:40:02,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1071] L1041-6-->L1045-2: Formula: (and (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][148], [326#true, 338#(= |#race~len~0| 0), 324#true, 347#true, 328#true, 352#true, Black: 342#true, 290#L1043-6true, 155#L1045-2true, 92#L1061-4true, 270#L1045-2true, Black: 350#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0))]) [2024-11-20 13:40:02,034 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2024-11-20 13:40:02,034 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-20 13:40:02,034 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-20 13:40:02,034 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-20 13:40:02,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][115], [326#true, 350#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 338#(= |#race~len~0| 0), 324#true, 241#L1045-2true, Black: 344#(= |#race~next~0| 0), 352#true, 328#true, 155#L1045-2true, 270#L1045-2true, 92#L1061-4true]) [2024-11-20 13:40:02,092 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-11-20 13:40:02,092 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-20 13:40:02,092 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-20 13:40:02,092 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-20 13:40:03,444 INFO L124 PetriNetUnfolderBase]: 2233/24093 cut-off events. [2024-11-20 13:40:03,444 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-11-20 13:40:03,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28138 conditions, 24093 events. 2233/24093 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 353759 event pairs, 1151 based on Foata normal form. 1/20432 useless extension candidates. Maximal degree in co-relation 28093. Up to 2300 conditions per place. [2024-11-20 13:40:03,677 INFO L140 encePairwiseOnDemand]: 334/338 looper letters, 20 selfloop transitions, 0 changer transitions 4/329 dead transitions. [2024-11-20 13:40:03,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 329 transitions, 835 flow [2024-11-20 13:40:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 13:40:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 13:40:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1525 transitions. [2024-11-20 13:40:03,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9023668639053254 [2024-11-20 13:40:03,682 INFO L175 Difference]: Start difference. First operand has 312 places, 326 transitions, 781 flow. Second operand 5 states and 1525 transitions. [2024-11-20 13:40:03,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 329 transitions, 835 flow [2024-11-20 13:40:03,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 329 transitions, 829 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 13:40:03,689 INFO L231 Difference]: Finished difference. Result has 316 places, 325 transitions, 779 flow [2024-11-20 13:40:03,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=779, PETRI_PLACES=316, PETRI_TRANSITIONS=325} [2024-11-20 13:40:03,690 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -11 predicate places. [2024-11-20 13:40:03,690 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 325 transitions, 779 flow [2024-11-20 13:40:03,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 302.6) internal successors, (1513), 5 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:40:03,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:40:03,691 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:40:03,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 13:40:03,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-20 13:40:03,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:40:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash 407754066, now seen corresponding path program 1 times [2024-11-20 13:40:03,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:40:03,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090201764] [2024-11-20 13:40:03,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:40:03,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:40:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 13:40:03,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 13:40:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 13:40:03,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 13:40:03,748 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 13:40:03,749 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2024-11-20 13:40:03,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2024-11-20 13:40:03,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2024-11-20 13:40:03,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2024-11-20 13:40:03,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2024-11-20 13:40:03,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2024-11-20 13:40:03,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2024-11-20 13:40:03,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2024-11-20 13:40:03,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2024-11-20 13:40:03,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2024-11-20 13:40:03,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2024-11-20 13:40:03,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2024-11-20 13:40:03,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2024-11-20 13:40:03,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2024-11-20 13:40:03,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2024-11-20 13:40:03,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2024-11-20 13:40:03,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2024-11-20 13:40:03,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2024-11-20 13:40:03,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2024-11-20 13:40:03,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2024-11-20 13:40:03,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2024-11-20 13:40:03,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2024-11-20 13:40:03,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2024-11-20 13:40:03,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2024-11-20 13:40:03,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2024-11-20 13:40:03,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2024-11-20 13:40:03,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2024-11-20 13:40:03,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2024-11-20 13:40:03,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2024-11-20 13:40:03,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2024-11-20 13:40:03,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2024-11-20 13:40:03,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2024-11-20 13:40:03,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2024-11-20 13:40:03,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2024-11-20 13:40:03,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2024-11-20 13:40:03,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2024-11-20 13:40:03,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2024-11-20 13:40:03,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2024-11-20 13:40:03,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2024-11-20 13:40:03,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2024-11-20 13:40:03,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2024-11-20 13:40:03,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2024-11-20 13:40:03,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2024-11-20 13:40:03,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2024-11-20 13:40:03,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2024-11-20 13:40:03,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2024-11-20 13:40:03,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2024-11-20 13:40:03,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2024-11-20 13:40:03,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2024-11-20 13:40:03,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2024-11-20 13:40:03,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2024-11-20 13:40:03,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 13:40:03,757 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:40:03,758 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 13:40:03,758 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-20 13:40:03,823 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 13:40:03,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 410 places, 424 transitions, 876 flow [2024-11-20 13:40:03,924 INFO L124 PetriNetUnfolderBase]: 27/474 cut-off events. [2024-11-20 13:40:03,924 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-20 13:40:03,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 474 events. 27/474 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1569 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 383. Up to 10 conditions per place. [2024-11-20 13:40:03,932 INFO L82 GeneralOperation]: Start removeDead. Operand has 410 places, 424 transitions, 876 flow [2024-11-20 13:40:03,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 410 places, 424 transitions, 876 flow [2024-11-20 13:40:03,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:40:03,945 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;@2f051a9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:40:03,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-20 13:40:03,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:40:03,948 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-20 13:40:03,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:40:03,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:40:03,948 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] [2024-11-20 13:40:03,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2024-11-20 13:40:03,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:40:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash 639071663, now seen corresponding path program 1 times [2024-11-20 13:40:03,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:40:03,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458600031] [2024-11-20 13:40:03,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:40:03,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:40:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:40:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:40:03,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:40:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458600031] [2024-11-20 13:40:03,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458600031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:40:03,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:40:03,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:40:03,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426524986] [2024-11-20 13:40:03,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:40:03,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:40:03,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:40:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:40:03,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:40:04,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 424 [2024-11-20 13:40:04,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 424 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:40:04,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:40:04,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 424 [2024-11-20 13:40:04,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:40:10,049 INFO L124 PetriNetUnfolderBase]: 7737/41871 cut-off events. [2024-11-20 13:40:10,049 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2024-11-20 13:40:10,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53420 conditions, 41871 events. 7737/41871 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1133. Compared 611898 event pairs, 6804 based on Foata normal form. 5588/40928 useless extension candidates. Maximal degree in co-relation 44090. Up to 9608 conditions per place. [2024-11-20 13:40:10,491 INFO L140 encePairwiseOnDemand]: 406/424 looper letters, 31 selfloop transitions, 2 changer transitions 1/395 dead transitions. [2024-11-20 13:40:10,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 395 transitions, 884 flow [2024-11-20 13:40:10,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:40:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:40:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1159 transitions. [2024-11-20 13:40:10,494 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9111635220125787 [2024-11-20 13:40:10,494 INFO L175 Difference]: Start difference. First operand has 410 places, 424 transitions, 876 flow. Second operand 3 states and 1159 transitions. [2024-11-20 13:40:10,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 395 transitions, 884 flow [2024-11-20 13:40:10,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 395 transitions, 878 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-20 13:40:10,501 INFO L231 Difference]: Finished difference. Result has 397 places, 394 transitions, 814 flow [2024-11-20 13:40:10,502 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=397, PETRI_TRANSITIONS=394} [2024-11-20 13:40:10,502 INFO L277 CegarLoopForPetriNet]: 410 programPoint places, -13 predicate places. [2024-11-20 13:40:10,502 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 394 transitions, 814 flow [2024-11-20 13:40:10,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:40:10,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:40:10,503 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] [2024-11-20 13:40:10,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 13:40:10,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2024-11-20 13:40:10,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:40:10,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1967473087, now seen corresponding path program 1 times [2024-11-20 13:40:10,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:40:10,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930550037] [2024-11-20 13:40:10,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:40:10,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:40:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:40:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:40:10,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:40:10,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930550037] [2024-11-20 13:40:10,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930550037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:40:10,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:40:10,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:40:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901989377] [2024-11-20 13:40:10,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:40:10,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:40:10,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:40:10,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:40:10,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:40:10,560 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 424 [2024-11-20 13:40:10,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 394 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:40:10,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:40:10,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 424 [2024-11-20 13:40:10,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:40:12,028 INFO L124 PetriNetUnfolderBase]: 909/9199 cut-off events. [2024-11-20 13:40:12,029 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-20 13:40:12,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10494 conditions, 9199 events. 909/9199 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 110277 event pairs, 684 based on Foata normal form. 0/7626 useless extension candidates. Maximal degree in co-relation 10458. Up to 1031 conditions per place. [2024-11-20 13:40:12,159 INFO L140 encePairwiseOnDemand]: 421/424 looper letters, 22 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2024-11-20 13:40:12,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 393 transitions, 860 flow [2024-11-20 13:40:12,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:40:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:40:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1162 transitions. [2024-11-20 13:40:12,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9135220125786163 [2024-11-20 13:40:12,163 INFO L175 Difference]: Start difference. First operand has 397 places, 394 transitions, 814 flow. Second operand 3 states and 1162 transitions. [2024-11-20 13:40:12,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 393 transitions, 860 flow [2024-11-20 13:40:12,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 393 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:40:12,170 INFO L231 Difference]: Finished difference. Result has 395 places, 393 transitions, 812 flow [2024-11-20 13:40:12,171 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=395, PETRI_TRANSITIONS=393} [2024-11-20 13:40:12,171 INFO L277 CegarLoopForPetriNet]: 410 programPoint places, -15 predicate places. [2024-11-20 13:40:12,172 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 393 transitions, 812 flow [2024-11-20 13:40:12,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:40:12,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:40:12,172 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] [2024-11-20 13:40:12,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 13:40:12,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2024-11-20 13:40:12,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:40:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash 423291184, now seen corresponding path program 1 times [2024-11-20 13:40:12,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:40:12,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758679830] [2024-11-20 13:40:12,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:40:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:40:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:40:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:40:12,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:40:12,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758679830] [2024-11-20 13:40:12,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758679830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:40:12,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:40:12,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:40:12,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070642564] [2024-11-20 13:40:12,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:40:12,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:40:12,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:40:12,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:40:12,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:40:12,231 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 424 [2024-11-20 13:40:12,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 393 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:40:12,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:40:12,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 424 [2024-11-20 13:40:12,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:40:14,827 INFO L124 PetriNetUnfolderBase]: 2261/20900 cut-off events. [2024-11-20 13:40:14,827 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2024-11-20 13:40:14,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23883 conditions, 20900 events. 2261/20900 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 295599 event pairs, 1720 based on Foata normal form. 0/17502 useless extension candidates. Maximal degree in co-relation 23839. Up to 2506 conditions per place. [2024-11-20 13:40:15,021 INFO L140 encePairwiseOnDemand]: 416/424 looper letters, 26 selfloop transitions, 1 changer transitions 0/386 dead transitions. [2024-11-20 13:40:15,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 386 transitions, 852 flow [2024-11-20 13:40:15,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:40:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:40:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1147 transitions. [2024-11-20 13:40:15,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9017295597484277 [2024-11-20 13:40:15,025 INFO L175 Difference]: Start difference. First operand has 395 places, 393 transitions, 812 flow. Second operand 3 states and 1147 transitions. [2024-11-20 13:40:15,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 386 transitions, 852 flow [2024-11-20 13:40:15,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 386 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:40:15,031 INFO L231 Difference]: Finished difference. Result has 388 places, 386 transitions, 796 flow [2024-11-20 13:40:15,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=388, PETRI_TRANSITIONS=386} [2024-11-20 13:40:15,032 INFO L277 CegarLoopForPetriNet]: 410 programPoint places, -22 predicate places. [2024-11-20 13:40:15,032 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 386 transitions, 796 flow [2024-11-20 13:40:15,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:40:15,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:40:15,033 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] [2024-11-20 13:40:15,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 13:40:15,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2024-11-20 13:40:15,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:40:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash -963294461, now seen corresponding path program 1 times [2024-11-20 13:40:15,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:40:15,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535294477] [2024-11-20 13:40:15,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:40:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:40:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:40:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:40:15,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:40:15,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535294477] [2024-11-20 13:40:15,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535294477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:40:15,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:40:15,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:40:15,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874516371] [2024-11-20 13:40:15,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:40:15,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:40:15,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:40:15,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:40:15,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:40:15,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 424 [2024-11-20 13:40:15,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 386 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:40:15,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:40:15,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 424 [2024-11-20 13:40:15,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:40:18,791 INFO L124 PetriNetUnfolderBase]: 4251/26681 cut-off events. [2024-11-20 13:40:18,791 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2024-11-20 13:40:18,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32654 conditions, 26681 events. 4251/26681 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 358593 event pairs, 3630 based on Foata normal form. 0/22524 useless extension candidates. Maximal degree in co-relation 32610. Up to 5188 conditions per place. [2024-11-20 13:40:19,064 INFO L140 encePairwiseOnDemand]: 421/424 looper letters, 27 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2024-11-20 13:40:19,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 385 transitions, 852 flow [2024-11-20 13:40:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:40:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:40:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2024-11-20 13:40:19,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9056603773584906 [2024-11-20 13:40:19,067 INFO L175 Difference]: Start difference. First operand has 388 places, 386 transitions, 796 flow. Second operand 3 states and 1152 transitions. [2024-11-20 13:40:19,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 385 transitions, 852 flow [2024-11-20 13:40:19,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 385 transitions, 851 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:40:19,073 INFO L231 Difference]: Finished difference. Result has 388 places, 385 transitions, 797 flow [2024-11-20 13:40:19,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=388, PETRI_TRANSITIONS=385} [2024-11-20 13:40:19,074 INFO L277 CegarLoopForPetriNet]: 410 programPoint places, -22 predicate places. [2024-11-20 13:40:19,074 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 385 transitions, 797 flow [2024-11-20 13:40:19,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:40:19,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:40:19,075 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] [2024-11-20 13:40:19,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 13:40:19,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2024-11-20 13:40:19,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:40:19,077 INFO L85 PathProgramCache]: Analyzing trace with hash 417191485, now seen corresponding path program 1 times [2024-11-20 13:40:19,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:40:19,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865247816] [2024-11-20 13:40:19,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:40:19,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:40:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:40:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:40:19,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:40:19,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865247816] [2024-11-20 13:40:19,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865247816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:40:19,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:40:19,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:40:19,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342885266] [2024-11-20 13:40:19,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:40:19,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:40:19,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:40:19,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:40:19,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:40:19,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 424 [2024-11-20 13:40:19,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 385 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:40:19,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:40:19,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 424 [2024-11-20 13:40:19,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand