./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.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-race-challenges/thread-join-counter-outer-race-4.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 cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:01:15,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:01:15,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-20 14:01:15,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:01:15,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:01:15,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:01:15,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:01:15,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:01:15,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:01:15,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:01:15,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:01:15,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:01:15,448 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:01:15,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:01:15,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 14:01:15,451 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:01:15,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:01:15,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:01:15,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:01:15,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 14:01:15,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:01:15,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 14:01:15,458 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-20 14:01:15,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:01:15,458 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:01:15,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:01:15,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 14:01:15,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:01:15,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:01:15,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:01:15,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:01:15,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:01:15,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:01:15,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:01:15,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 14:01:15,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:01:15,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:01:15,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:01:15,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:01:15,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:01:15,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:01:15,465 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 -> cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb [2024-11-20 14:01:15,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:01:15,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:01:15,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:01:15,779 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:01:15,779 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:01:15,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-20 14:01:17,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:01:17,603 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:01:17,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-20 14:01:17,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d9273a9/b337ecb002fb44319eafd6799feece93/FLAG8beb635a1 [2024-11-20 14:01:17,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d9273a9/b337ecb002fb44319eafd6799feece93 [2024-11-20 14:01:17,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:01:17,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:01:17,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:01:17,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:01:17,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:01:17,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:01:17" (1/1) ... [2024-11-20 14:01:17,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5267f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:17, skipping insertion in model container [2024-11-20 14:01:17,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:01:17" (1/1) ... [2024-11-20 14:01:17,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:01:18,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:01:18,308 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:01:18,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:01:18,421 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:01:18,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18 WrapperNode [2024-11-20 14:01:18,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:01:18,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:01:18,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:01:18,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:01:18,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18" (1/1) ... [2024-11-20 14:01:18,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18" (1/1) ... [2024-11-20 14:01:18,481 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 198 [2024-11-20 14:01:18,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:01:18,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:01:18,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:01:18,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:01:18,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18" (1/1) ... [2024-11-20 14:01:18,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18" (1/1) ... [2024-11-20 14:01:18,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18" (1/1) ... [2024-11-20 14:01:18,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18" (1/1) ... [2024-11-20 14:01:18,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18" (1/1) ... [2024-11-20 14:01:18,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18" (1/1) ... [2024-11-20 14:01:18,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18" (1/1) ... [2024-11-20 14:01:18,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18" (1/1) ... [2024-11-20 14:01:18,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:01:18,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:01:18,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:01:18,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:01:18,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18" (1/1) ... [2024-11-20 14:01:18,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:01:18,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:01:18,558 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 14:01:18,561 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 14:01:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 14:01:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:01:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 14:01:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-20 14:01:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-20 14:01:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 14:01:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:01:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:01:18,607 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 14:01:18,737 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:01:18,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:01:19,037 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 14:01:19,037 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:01:19,072 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:01:19,072 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 14:01:19,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:01:19 BoogieIcfgContainer [2024-11-20 14:01:19,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:01:19,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:01:19,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:01:19,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:01:19,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:01:17" (1/3) ... [2024-11-20 14:01:19,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da7633d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:01:19, skipping insertion in model container [2024-11-20 14:01:19,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:01:18" (2/3) ... [2024-11-20 14:01:19,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da7633d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:01:19, skipping insertion in model container [2024-11-20 14:01:19,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:01:19" (3/3) ... [2024-11-20 14:01:19,085 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i [2024-11-20 14:01:19,103 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:01:19,104 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-20 14:01:19,104 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 14:01:19,171 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 14:01:19,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 232 transitions, 468 flow [2024-11-20 14:01:19,348 INFO L124 PetriNetUnfolderBase]: 7/274 cut-off events. [2024-11-20 14:01:19,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:01:19,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 274 events. 7/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 193. Up to 4 conditions per place. [2024-11-20 14:01:19,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 232 transitions, 468 flow [2024-11-20 14:01:19,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 232 transitions, 468 flow [2024-11-20 14:01:19,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:01:19,398 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@37d6213c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:01:19,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-20 14:01:19,447 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:01:19,448 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-20 14:01:19,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:01:19,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:19,449 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:19,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-20 14:01:19,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1558289720, now seen corresponding path program 1 times [2024-11-20 14:01:19,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:19,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344621832] [2024-11-20 14:01:19,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:19,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:19,955 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 14:01:19,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:19,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344621832] [2024-11-20 14:01:19,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344621832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:19,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:19,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416539777] [2024-11-20 14:01:19,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:19,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:19,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:20,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:20,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:20,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232 [2024-11-20 14:01:20,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 232 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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 14:01:20,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:20,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232 [2024-11-20 14:01:20,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:20,260 INFO L124 PetriNetUnfolderBase]: 98/684 cut-off events. [2024-11-20 14:01:20,260 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 14:01:20,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 684 events. 98/684 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3162 event pairs, 33 based on Foata normal form. 9/637 useless extension candidates. Maximal degree in co-relation 707. Up to 138 conditions per place. [2024-11-20 14:01:20,270 INFO L140 encePairwiseOnDemand]: 218/232 looper letters, 32 selfloop transitions, 8 changer transitions 1/247 dead transitions. [2024-11-20 14:01:20,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 578 flow [2024-11-20 14:01:20,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-20 14:01:20,289 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9612068965517241 [2024-11-20 14:01:20,294 INFO L175 Difference]: Start difference. First operand has 231 places, 232 transitions, 468 flow. Second operand 3 states and 669 transitions. [2024-11-20 14:01:20,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 578 flow [2024-11-20 14:01:20,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 247 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 14:01:20,307 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 530 flow [2024-11-20 14:01:20,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2024-11-20 14:01:20,316 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2024-11-20 14:01:20,317 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 530 flow [2024-11-20 14:01:20,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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 14:01:20,318 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:20,318 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:20,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:01:20,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-20 14:01:20,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:20,320 INFO L85 PathProgramCache]: Analyzing trace with hash -393361375, now seen corresponding path program 1 times [2024-11-20 14:01:20,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:20,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128254717] [2024-11-20 14:01:20,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:20,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:20,581 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 14:01:20,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:20,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128254717] [2024-11-20 14:01:20,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128254717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:20,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:20,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:20,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240966674] [2024-11-20 14:01:20,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:20,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:20,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:20,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:20,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:20,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232 [2024-11-20 14:01:20,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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 14:01:20,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:20,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232 [2024-11-20 14:01:20,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:20,798 INFO L124 PetriNetUnfolderBase]: 114/812 cut-off events. [2024-11-20 14:01:20,798 INFO L125 PetriNetUnfolderBase]: For 164/171 co-relation queries the response was YES. [2024-11-20 14:01:20,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 812 events. 114/812 cut-off events. For 164/171 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4213 event pairs, 72 based on Foata normal form. 5/762 useless extension candidates. Maximal degree in co-relation 1025. Up to 226 conditions per place. [2024-11-20 14:01:20,805 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 29 selfloop transitions, 7 changer transitions 0/245 dead transitions. [2024-11-20 14:01:20,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 245 transitions, 630 flow [2024-11-20 14:01:20,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:20,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2024-11-20 14:01:20,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9367816091954023 [2024-11-20 14:01:20,808 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 530 flow. Second operand 3 states and 652 transitions. [2024-11-20 14:01:20,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 245 transitions, 630 flow [2024-11-20 14:01:20,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:20,820 INFO L231 Difference]: Finished difference. Result has 236 places, 241 transitions, 570 flow [2024-11-20 14:01:20,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=236, PETRI_TRANSITIONS=241} [2024-11-20 14:01:20,822 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2024-11-20 14:01:20,822 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 241 transitions, 570 flow [2024-11-20 14:01:20,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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 14:01:20,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:20,823 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:20,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:01:20,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-20 14:01:20,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:20,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1871831431, now seen corresponding path program 1 times [2024-11-20 14:01:20,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:20,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591011945] [2024-11-20 14:01:20,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:20,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:20,968 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 14:01:20,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:20,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591011945] [2024-11-20 14:01:20,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591011945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:20,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:20,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:20,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807864562] [2024-11-20 14:01:20,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:20,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:20,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:20,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:20,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:20,985 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 232 [2024-11-20 14:01:20,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 241 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:01:20,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:20,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 232 [2024-11-20 14:01:20,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:21,137 INFO L124 PetriNetUnfolderBase]: 83/734 cut-off events. [2024-11-20 14:01:21,138 INFO L125 PetriNetUnfolderBase]: For 64/67 co-relation queries the response was YES. [2024-11-20 14:01:21,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 734 events. 83/734 cut-off events. For 64/67 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3732 event pairs, 45 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 838. Up to 114 conditions per place. [2024-11-20 14:01:21,143 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 17 selfloop transitions, 3 changer transitions 1/247 dead transitions. [2024-11-20 14:01:21,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 624 flow [2024-11-20 14:01:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2024-11-20 14:01:21,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2024-11-20 14:01:21,147 INFO L175 Difference]: Start difference. First operand has 236 places, 241 transitions, 570 flow. Second operand 3 states and 664 transitions. [2024-11-20 14:01:21,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 624 flow [2024-11-20 14:01:21,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:21,154 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 578 flow [2024-11-20 14:01:21,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2024-11-20 14:01:21,156 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 7 predicate places. [2024-11-20 14:01:21,157 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 578 flow [2024-11-20 14:01:21,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:01:21,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:21,158 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:21,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:01:21,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-20 14:01:21,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:21,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2000284448, now seen corresponding path program 1 times [2024-11-20 14:01:21,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:21,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917027855] [2024-11-20 14:01:21,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:21,282 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 14:01:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:21,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917027855] [2024-11-20 14:01:21,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917027855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:21,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:21,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:21,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383733896] [2024-11-20 14:01:21,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:21,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:21,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:21,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:21,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 232 [2024-11-20 14:01:21,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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 14:01:21,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:21,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 232 [2024-11-20 14:01:21,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:21,433 INFO L124 PetriNetUnfolderBase]: 92/747 cut-off events. [2024-11-20 14:01:21,434 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2024-11-20 14:01:21,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 747 events. 92/747 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3947 event pairs, 54 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 914. Up to 141 conditions per place. [2024-11-20 14:01:21,438 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 22 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2024-11-20 14:01:21,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 252 transitions, 654 flow [2024-11-20 14:01:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2024-11-20 14:01:21,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9525862068965517 [2024-11-20 14:01:21,442 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 578 flow. Second operand 3 states and 663 transitions. [2024-11-20 14:01:21,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 252 transitions, 654 flow [2024-11-20 14:01:21,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 252 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:21,450 INFO L231 Difference]: Finished difference. Result has 240 places, 246 transitions, 608 flow [2024-11-20 14:01:21,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=240, PETRI_TRANSITIONS=246} [2024-11-20 14:01:21,452 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 9 predicate places. [2024-11-20 14:01:21,452 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 246 transitions, 608 flow [2024-11-20 14:01:21,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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 14:01:21,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:21,453 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:21,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:01:21,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-20 14:01:21,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash 319446888, now seen corresponding path program 1 times [2024-11-20 14:01:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:21,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706046605] [2024-11-20 14:01:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:21,565 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 14:01:21,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:21,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706046605] [2024-11-20 14:01:21,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706046605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:21,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:21,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:21,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110372514] [2024-11-20 14:01:21,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:21,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:21,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:21,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:21,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:21,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 232 [2024-11-20 14:01:21,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 246 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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 14:01:21,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:21,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 232 [2024-11-20 14:01:21,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:21,738 INFO L124 PetriNetUnfolderBase]: 159/927 cut-off events. [2024-11-20 14:01:21,739 INFO L125 PetriNetUnfolderBase]: For 211/217 co-relation queries the response was YES. [2024-11-20 14:01:21,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 927 events. 159/927 cut-off events. For 211/217 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5124 event pairs, 73 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1385. Up to 275 conditions per place. [2024-11-20 14:01:21,743 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 29 selfloop transitions, 11 changer transitions 4/259 dead transitions. [2024-11-20 14:01:21,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 730 flow [2024-11-20 14:01:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2024-11-20 14:01:21,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468390804597702 [2024-11-20 14:01:21,746 INFO L175 Difference]: Start difference. First operand has 240 places, 246 transitions, 608 flow. Second operand 3 states and 659 transitions. [2024-11-20 14:01:21,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 730 flow [2024-11-20 14:01:21,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:21,752 INFO L231 Difference]: Finished difference. Result has 242 places, 250 transitions, 674 flow [2024-11-20 14:01:21,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=242, PETRI_TRANSITIONS=250} [2024-11-20 14:01:21,754 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2024-11-20 14:01:21,754 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 250 transitions, 674 flow [2024-11-20 14:01:21,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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 14:01:21,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:21,756 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:21,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:01:21,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-20 14:01:21,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2093932926, now seen corresponding path program 1 times [2024-11-20 14:01:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:21,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515124808] [2024-11-20 14:01:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:01:21,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:01:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:01:21,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:01:21,909 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:01:21,913 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-20 14:01:21,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-20 14:01:21,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-20 14:01:21,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-20 14:01:21,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-20 14:01:21,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-20 14:01:21,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-20 14:01:21,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-20 14:01:21,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-20 14:01:21,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-20 14:01:21,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-20 14:01:21,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:01:21,917 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 14:01:21,922 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 14:01:21,922 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-20 14:01:21,952 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 14:01:21,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 262 transitions, 534 flow [2024-11-20 14:01:22,022 INFO L124 PetriNetUnfolderBase]: 10/354 cut-off events. [2024-11-20 14:01:22,023 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 14:01:22,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 354 events. 10/354 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 410 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 275. Up to 6 conditions per place. [2024-11-20 14:01:22,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 262 transitions, 534 flow [2024-11-20 14:01:22,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 262 transitions, 534 flow [2024-11-20 14:01:22,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:01:22,030 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;@37d6213c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:01:22,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-20 14:01:22,048 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:01:22,049 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-20 14:01:22,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:01:22,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:22,050 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:22,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-20 14:01:22,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:22,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1014442248, now seen corresponding path program 1 times [2024-11-20 14:01:22,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:22,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009795839] [2024-11-20 14:01:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:22,128 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 14:01:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:22,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009795839] [2024-11-20 14:01:22,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009795839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:22,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:22,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763305032] [2024-11-20 14:01:22,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:22,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:22,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:22,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:22,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:22,163 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 262 [2024-11-20 14:01:22,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 262 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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 14:01:22,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:22,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 262 [2024-11-20 14:01:22,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:23,281 INFO L124 PetriNetUnfolderBase]: 2216/6761 cut-off events. [2024-11-20 14:01:23,281 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-20 14:01:23,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 6761 events. 2216/6761 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 63917 event pairs, 879 based on Foata normal form. 92/6148 useless extension candidates. Maximal degree in co-relation 8872. Up to 2089 conditions per place. [2024-11-20 14:01:23,328 INFO L140 encePairwiseOnDemand]: 244/262 looper letters, 46 selfloop transitions, 11 changer transitions 1/285 dead transitions. [2024-11-20 14:01:23,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 285 transitions, 699 flow [2024-11-20 14:01:23,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-11-20 14:01:23,331 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9541984732824428 [2024-11-20 14:01:23,331 INFO L175 Difference]: Start difference. First operand has 263 places, 262 transitions, 534 flow. Second operand 3 states and 750 transitions. [2024-11-20 14:01:23,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 285 transitions, 699 flow [2024-11-20 14:01:23,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 285 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 14:01:23,339 INFO L231 Difference]: Finished difference. Result has 267 places, 269 transitions, 622 flow [2024-11-20 14:01:23,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=267, PETRI_TRANSITIONS=269} [2024-11-20 14:01:23,340 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 4 predicate places. [2024-11-20 14:01:23,340 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 269 transitions, 622 flow [2024-11-20 14:01:23,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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 14:01:23,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:23,341 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:23,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:01:23,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-20 14:01:23,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:23,345 INFO L85 PathProgramCache]: Analyzing trace with hash 755746279, now seen corresponding path program 1 times [2024-11-20 14:01:23,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:23,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413609133] [2024-11-20 14:01:23,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:23,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:23,415 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 14:01:23,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:23,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413609133] [2024-11-20 14:01:23,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413609133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:23,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:23,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:23,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186922658] [2024-11-20 14:01:23,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:23,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:23,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:23,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:23,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:23,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 262 [2024-11-20 14:01:23,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 269 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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 14:01:23,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:23,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 262 [2024-11-20 14:01:23,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:25,043 INFO L124 PetriNetUnfolderBase]: 2480/8562 cut-off events. [2024-11-20 14:01:25,044 INFO L125 PetriNetUnfolderBase]: For 2807/3012 co-relation queries the response was YES. [2024-11-20 14:01:25,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15328 conditions, 8562 events. 2480/8562 cut-off events. For 2807/3012 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 88093 event pairs, 1597 based on Foata normal form. 70/7873 useless extension candidates. Maximal degree in co-relation 13171. Up to 3442 conditions per place. [2024-11-20 14:01:25,122 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 42 selfloop transitions, 12 changer transitions 0/287 dead transitions. [2024-11-20 14:01:25,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 790 flow [2024-11-20 14:01:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2024-11-20 14:01:25,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9338422391857506 [2024-11-20 14:01:25,124 INFO L175 Difference]: Start difference. First operand has 267 places, 269 transitions, 622 flow. Second operand 3 states and 734 transitions. [2024-11-20 14:01:25,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 790 flow [2024-11-20 14:01:25,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:25,139 INFO L231 Difference]: Finished difference. Result has 268 places, 279 transitions, 706 flow [2024-11-20 14:01:25,140 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=268, PETRI_TRANSITIONS=279} [2024-11-20 14:01:25,142 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2024-11-20 14:01:25,142 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 279 transitions, 706 flow [2024-11-20 14:01:25,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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 14:01:25,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:25,143 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:25,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:01:25,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-20 14:01:25,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash -609232263, now seen corresponding path program 1 times [2024-11-20 14:01:25,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:25,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053119204] [2024-11-20 14:01:25,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:25,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:25,306 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 14:01:25,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:25,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053119204] [2024-11-20 14:01:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053119204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:25,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:25,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:25,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121224690] [2024-11-20 14:01:25,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:25,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:25,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:25,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:25,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:25,323 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 262 [2024-11-20 14:01:25,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 279 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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 14:01:25,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:25,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 262 [2024-11-20 14:01:25,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:26,692 INFO L124 PetriNetUnfolderBase]: 1878/7688 cut-off events. [2024-11-20 14:01:26,693 INFO L125 PetriNetUnfolderBase]: For 1101/1918 co-relation queries the response was YES. [2024-11-20 14:01:26,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12618 conditions, 7688 events. 1878/7688 cut-off events. For 1101/1918 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 82748 event pairs, 1092 based on Foata normal form. 7/6759 useless extension candidates. Maximal degree in co-relation 10919. Up to 1725 conditions per place. [2024-11-20 14:01:26,751 INFO L140 encePairwiseOnDemand]: 257/262 looper letters, 28 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2024-11-20 14:01:26,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 792 flow [2024-11-20 14:01:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2024-11-20 14:01:26,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.950381679389313 [2024-11-20 14:01:26,754 INFO L175 Difference]: Start difference. First operand has 268 places, 279 transitions, 706 flow. Second operand 3 states and 747 transitions. [2024-11-20 14:01:26,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 792 flow [2024-11-20 14:01:26,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 290 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:26,766 INFO L231 Difference]: Finished difference. Result has 270 places, 282 transitions, 712 flow [2024-11-20 14:01:26,767 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=270, PETRI_TRANSITIONS=282} [2024-11-20 14:01:26,768 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 7 predicate places. [2024-11-20 14:01:26,769 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 282 transitions, 712 flow [2024-11-20 14:01:26,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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 14:01:26,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:26,770 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:26,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:01:26,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-20 14:01:26,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:26,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1402832215, now seen corresponding path program 1 times [2024-11-20 14:01:26,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:26,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307593950] [2024-11-20 14:01:26,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:26,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:26,838 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 14:01:26,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:26,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307593950] [2024-11-20 14:01:26,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307593950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:26,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:26,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:26,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742344290] [2024-11-20 14:01:26,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:26,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:26,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:26,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:26,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262 [2024-11-20 14:01:26,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 282 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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 14:01:26,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:26,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262 [2024-11-20 14:01:26,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:28,447 INFO L124 PetriNetUnfolderBase]: 2430/9836 cut-off events. [2024-11-20 14:01:28,447 INFO L125 PetriNetUnfolderBase]: For 1611/2578 co-relation queries the response was YES. [2024-11-20 14:01:28,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16531 conditions, 9836 events. 2430/9836 cut-off events. For 1611/2578 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 113160 event pairs, 1418 based on Foata normal form. 11/8675 useless extension candidates. Maximal degree in co-relation 14739. Up to 2447 conditions per place. [2024-11-20 14:01:28,511 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 7 changer transitions 0/298 dead transitions. [2024-11-20 14:01:28,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 298 transitions, 841 flow [2024-11-20 14:01:28,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2024-11-20 14:01:28,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.950381679389313 [2024-11-20 14:01:28,514 INFO L175 Difference]: Start difference. First operand has 270 places, 282 transitions, 712 flow. Second operand 3 states and 747 transitions. [2024-11-20 14:01:28,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 298 transitions, 841 flow [2024-11-20 14:01:28,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 298 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:28,526 INFO L231 Difference]: Finished difference. Result has 272 places, 287 transitions, 760 flow [2024-11-20 14:01:28,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=272, PETRI_TRANSITIONS=287} [2024-11-20 14:01:28,528 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 9 predicate places. [2024-11-20 14:01:28,528 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 287 transitions, 760 flow [2024-11-20 14:01:28,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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 14:01:28,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:28,529 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:28,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:01:28,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-20 14:01:28,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash -434774543, now seen corresponding path program 1 times [2024-11-20 14:01:28,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:28,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830602549] [2024-11-20 14:01:28,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:28,597 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 14:01:28,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:28,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830602549] [2024-11-20 14:01:28,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830602549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:28,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:28,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:28,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586082706] [2024-11-20 14:01:28,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:28,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:28,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:28,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:28,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:28,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262 [2024-11-20 14:01:28,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 287 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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 14:01:28,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:28,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262 [2024-11-20 14:01:28,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:30,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][270], [281#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-20 14:01:30,218 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-20 14:01:30,218 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-20 14:01:30,218 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-20 14:01:30,219 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-20 14:01:30,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [281#true, 38#L697true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-20 14:01:30,317 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-20 14:01:30,317 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-20 14:01:30,317 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-20 14:01:30,317 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-20 14:01:30,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [260#L697-3true, 281#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-20 14:01:30,361 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2024-11-20 14:01:30,361 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-20 14:01:30,361 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-20 14:01:30,361 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-20 14:01:30,524 INFO L124 PetriNetUnfolderBase]: 4089/13244 cut-off events. [2024-11-20 14:01:30,525 INFO L125 PetriNetUnfolderBase]: For 5573/5897 co-relation queries the response was YES. [2024-11-20 14:01:30,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25628 conditions, 13244 events. 4089/13244 cut-off events. For 5573/5897 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 146600 event pairs, 2075 based on Foata normal form. 79/11927 useless extension candidates. Maximal degree in co-relation 21564. Up to 5204 conditions per place. [2024-11-20 14:01:30,625 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 49 selfloop transitions, 19 changer transitions 0/313 dead transitions. [2024-11-20 14:01:30,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 313 transitions, 997 flow [2024-11-20 14:01:30,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-11-20 14:01:30,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9440203562340967 [2024-11-20 14:01:30,628 INFO L175 Difference]: Start difference. First operand has 272 places, 287 transitions, 760 flow. Second operand 3 states and 742 transitions. [2024-11-20 14:01:30,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 313 transitions, 997 flow [2024-11-20 14:01:30,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 313 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:30,638 INFO L231 Difference]: Finished difference. Result has 274 places, 302 transitions, 928 flow [2024-11-20 14:01:30,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=274, PETRI_TRANSITIONS=302} [2024-11-20 14:01:30,639 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2024-11-20 14:01:30,640 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 302 transitions, 928 flow [2024-11-20 14:01:30,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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 14:01:30,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:30,641 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:30,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:01:30,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-20 14:01:30,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:30,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1143101991, now seen corresponding path program 1 times [2024-11-20 14:01:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:30,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946523576] [2024-11-20 14:01:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:01:31,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946523576] [2024-11-20 14:01:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946523576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:01:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495492567] [2024-11-20 14:01:31,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:31,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:01:31,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:01:31,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:01:31,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 14:01:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:31,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:01:31,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:01:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:01:31,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:01:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495492567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:31,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:01:31,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-20 14:01:31,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167066805] [2024-11-20 14:01:31,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:31,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:01:31,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:31,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:01:31,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:01:31,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 262 [2024-11-20 14:01:31,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 302 transitions, 928 flow. Second operand has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 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 14:01:31,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:31,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 262 [2024-11-20 14:01:31,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:33,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][281], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-20 14:01:33,278 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-20 14:01:33,278 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-20 14:01:33,278 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-20 14:01:33,278 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-20 14:01:33,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][281], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true, 295#(<= 1 ~threads_alive~0)]) [2024-11-20 14:01:33,283 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-20 14:01:33,284 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-20 14:01:33,284 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-20 14:01:33,284 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-20 14:01:33,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [38#L697true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-20 14:01:33,507 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-20 14:01:33,507 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-20 14:01:33,507 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-20 14:01:33,508 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-20 14:01:33,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [38#L697true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, 295#(<= 1 ~threads_alive~0), Black: 266#true]) [2024-11-20 14:01:33,511 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-20 14:01:33,511 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-20 14:01:33,511 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-20 14:01:33,511 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-20 14:01:34,013 INFO L124 PetriNetUnfolderBase]: 5622/18915 cut-off events. [2024-11-20 14:01:34,013 INFO L125 PetriNetUnfolderBase]: For 9477/10449 co-relation queries the response was YES. [2024-11-20 14:01:34,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38392 conditions, 18915 events. 5622/18915 cut-off events. For 9477/10449 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 229256 event pairs, 1257 based on Foata normal form. 132/17167 useless extension candidates. Maximal degree in co-relation 30507. Up to 3127 conditions per place. [2024-11-20 14:01:34,131 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 69 selfloop transitions, 14 changer transitions 3/361 dead transitions. [2024-11-20 14:01:34,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 361 transitions, 1219 flow [2024-11-20 14:01:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:01:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 14:01:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1718 transitions. [2024-11-20 14:01:34,135 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9367502726281353 [2024-11-20 14:01:34,135 INFO L175 Difference]: Start difference. First operand has 274 places, 302 transitions, 928 flow. Second operand 7 states and 1718 transitions. [2024-11-20 14:01:34,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 361 transitions, 1219 flow [2024-11-20 14:01:34,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 361 transitions, 1181 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:34,195 INFO L231 Difference]: Finished difference. Result has 281 places, 315 transitions, 969 flow [2024-11-20 14:01:34,196 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=969, PETRI_PLACES=281, PETRI_TRANSITIONS=315} [2024-11-20 14:01:34,196 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 18 predicate places. [2024-11-20 14:01:34,196 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 315 transitions, 969 flow [2024-11-20 14:01:34,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 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 14:01:34,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:34,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:34,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 14:01:34,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-20 14:01:34,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-20 14:01:34,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:34,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1106641400, now seen corresponding path program 1 times [2024-11-20 14:01:34,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:34,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065952068] [2024-11-20 14:01:34,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 14:01:34,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:34,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065952068] [2024-11-20 14:01:34,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065952068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:34,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:34,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:01:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906011290] [2024-11-20 14:01:34,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:34,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:01:34,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:34,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:01:34,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:01:34,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 262 [2024-11-20 14:01:34,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 315 transitions, 969 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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 14:01:34,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:34,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 262 [2024-11-20 14:01:34,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:35,140 INFO L124 PetriNetUnfolderBase]: 216/1813 cut-off events. [2024-11-20 14:01:35,140 INFO L125 PetriNetUnfolderBase]: For 464/477 co-relation queries the response was YES. [2024-11-20 14:01:35,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 1813 events. 216/1813 cut-off events. For 464/477 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12701 event pairs, 65 based on Foata normal form. 79/1813 useless extension candidates. Maximal degree in co-relation 2647. Up to 212 conditions per place. [2024-11-20 14:01:35,147 INFO L140 encePairwiseOnDemand]: 250/262 looper letters, 11 selfloop transitions, 12 changer transitions 0/275 dead transitions. [2024-11-20 14:01:35,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 275 transitions, 762 flow [2024-11-20 14:01:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:01:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 14:01:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2024-11-20 14:01:35,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9412213740458015 [2024-11-20 14:01:35,151 INFO L175 Difference]: Start difference. First operand has 281 places, 315 transitions, 969 flow. Second operand 5 states and 1233 transitions. [2024-11-20 14:01:35,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 275 transitions, 762 flow [2024-11-20 14:01:35,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 714 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-20 14:01:35,165 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 677 flow [2024-11-20 14:01:35,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=677, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2024-11-20 14:01:35,167 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 10 predicate places. [2024-11-20 14:01:35,167 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 677 flow [2024-11-20 14:01:35,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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 14:01:35,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:35,169 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:35,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 14:01:35,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-20 14:01:35,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:35,169 INFO L85 PathProgramCache]: Analyzing trace with hash 374705611, now seen corresponding path program 1 times [2024-11-20 14:01:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:35,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667641695] [2024-11-20 14:01:35,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:35,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-20 14:01:35,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:35,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667641695] [2024-11-20 14:01:35,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667641695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:35,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:35,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:35,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336992786] [2024-11-20 14:01:35,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:35,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:35,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:35,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:35,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:35,274 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262 [2024-11-20 14:01:35,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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 14:01:35,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:35,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262 [2024-11-20 14:01:35,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:35,666 INFO L124 PetriNetUnfolderBase]: 647/2737 cut-off events. [2024-11-20 14:01:35,666 INFO L125 PetriNetUnfolderBase]: For 860/872 co-relation queries the response was YES. [2024-11-20 14:01:35,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5217 conditions, 2737 events. 647/2737 cut-off events. For 860/872 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 21879 event pairs, 351 based on Foata normal form. 0/2592 useless extension candidates. Maximal degree in co-relation 4638. Up to 908 conditions per place. [2024-11-20 14:01:35,684 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 7 changer transitions 0/284 dead transitions. [2024-11-20 14:01:35,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 284 transitions, 811 flow [2024-11-20 14:01:35,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-20 14:01:35,686 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9491094147582697 [2024-11-20 14:01:35,687 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 677 flow. Second operand 3 states and 746 transitions. [2024-11-20 14:01:35,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 284 transitions, 811 flow [2024-11-20 14:01:35,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 284 transitions, 790 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 14:01:35,694 INFO L231 Difference]: Finished difference. Result has 274 places, 274 transitions, 718 flow [2024-11-20 14:01:35,694 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=274, PETRI_TRANSITIONS=274} [2024-11-20 14:01:35,695 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2024-11-20 14:01:35,696 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 274 transitions, 718 flow [2024-11-20 14:01:35,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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 14:01:35,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:35,697 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:35,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:01:35,697 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-20 14:01:35,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:35,697 INFO L85 PathProgramCache]: Analyzing trace with hash 773386076, now seen corresponding path program 1 times [2024-11-20 14:01:35,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:35,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839053665] [2024-11-20 14:01:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:35,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-20 14:01:35,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:35,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839053665] [2024-11-20 14:01:35,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839053665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:35,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:35,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:01:35,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230396741] [2024-11-20 14:01:35,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:35,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:35,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:35,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:35,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:35,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 262 [2024-11-20 14:01:35,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 274 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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 14:01:35,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:35,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 262 [2024-11-20 14:01:35,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:36,218 INFO L124 PetriNetUnfolderBase]: 335/2645 cut-off events. [2024-11-20 14:01:36,219 INFO L125 PetriNetUnfolderBase]: For 787/854 co-relation queries the response was YES. [2024-11-20 14:01:36,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4545 conditions, 2645 events. 335/2645 cut-off events. For 787/854 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 22776 event pairs, 62 based on Foata normal form. 12/2575 useless extension candidates. Maximal degree in co-relation 3284. Up to 495 conditions per place. [2024-11-20 14:01:36,232 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 21 selfloop transitions, 9 changer transitions 0/287 dead transitions. [2024-11-20 14:01:36,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 287 transitions, 819 flow [2024-11-20 14:01:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2024-11-20 14:01:36,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9643765903307888 [2024-11-20 14:01:36,236 INFO L175 Difference]: Start difference. First operand has 274 places, 274 transitions, 718 flow. Second operand 3 states and 758 transitions. [2024-11-20 14:01:36,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 287 transitions, 819 flow [2024-11-20 14:01:36,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 287 transitions, 805 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:01:36,245 INFO L231 Difference]: Finished difference. Result has 275 places, 281 transitions, 764 flow [2024-11-20 14:01:36,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=275, PETRI_TRANSITIONS=281} [2024-11-20 14:01:36,247 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 12 predicate places. [2024-11-20 14:01:36,247 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 281 transitions, 764 flow [2024-11-20 14:01:36,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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 14:01:36,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:36,249 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:36,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 14:01:36,249 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-20 14:01:36,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:36,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1258401358, now seen corresponding path program 2 times [2024-11-20 14:01:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:36,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181944247] [2024-11-20 14:01:36,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 14:01:36,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:36,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181944247] [2024-11-20 14:01:36,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181944247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:01:36,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096112752] [2024-11-20 14:01:36,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:01:36,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:01:36,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:01:36,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:01:36,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 14:01:36,760 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 14:01:36,761 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:01:36,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 14:01:36,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:01:37,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 14:01:37,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:01:37,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-20 14:01:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 14:01:37,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:01:37,380 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#threads_alive_mutex~0.base| v_ArrVal_1109) |c_~#data_mutex~0.base|) |c_~#data_mutex~0.offset|) 0))) is different from false [2024-11-20 14:01:37,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:01:37,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-20 14:01:37,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-20 14:01:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 11 not checked. [2024-11-20 14:01:37,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096112752] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:01:37,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:01:37,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-20 14:01:37,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159122392] [2024-11-20 14:01:37,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:01:37,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:01:37,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:37,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:01:37,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2024-11-20 14:01:37,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2024-11-20 14:01:37,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 281 transitions, 764 flow. Second operand has 12 states, 12 states have (on average 234.58333333333334) internal successors, (2815), 12 states have internal predecessors, (2815), 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 14:01:37,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:37,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2024-11-20 14:01:37,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:38,180 INFO L124 PetriNetUnfolderBase]: 192/1865 cut-off events. [2024-11-20 14:01:38,181 INFO L125 PetriNetUnfolderBase]: For 618/716 co-relation queries the response was YES. [2024-11-20 14:01:38,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 1865 events. 192/1865 cut-off events. For 618/716 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 13561 event pairs, 18 based on Foata normal form. 47/1867 useless extension candidates. Maximal degree in co-relation 2320. Up to 247 conditions per place. [2024-11-20 14:01:38,193 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 38 selfloop transitions, 8 changer transitions 2/290 dead transitions. [2024-11-20 14:01:38,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 290 transitions, 887 flow [2024-11-20 14:01:38,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:01:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 14:01:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1196 transitions. [2024-11-20 14:01:38,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9129770992366413 [2024-11-20 14:01:38,197 INFO L175 Difference]: Start difference. First operand has 275 places, 281 transitions, 764 flow. Second operand 5 states and 1196 transitions. [2024-11-20 14:01:38,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 290 transitions, 887 flow [2024-11-20 14:01:38,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 290 transitions, 876 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-20 14:01:38,207 INFO L231 Difference]: Finished difference. Result has 278 places, 277 transitions, 745 flow [2024-11-20 14:01:38,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=745, PETRI_PLACES=278, PETRI_TRANSITIONS=277} [2024-11-20 14:01:38,208 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 15 predicate places. [2024-11-20 14:01:38,208 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 277 transitions, 745 flow [2024-11-20 14:01:38,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 234.58333333333334) internal successors, (2815), 12 states have internal predecessors, (2815), 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 14:01:38,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:38,209 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:38,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 14:01:38,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-20 14:01:38,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-20 14:01:38,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1925231661, now seen corresponding path program 1 times [2024-11-20 14:01:38,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:38,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752762389] [2024-11-20 14:01:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:38,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-20 14:01:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:38,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752762389] [2024-11-20 14:01:38,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752762389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:38,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:38,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:38,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789553525] [2024-11-20 14:01:38,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:38,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:38,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:38,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:38,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:38,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262 [2024-11-20 14:01:38,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 277 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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 14:01:38,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:38,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262 [2024-11-20 14:01:38,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:01:38,873 INFO L124 PetriNetUnfolderBase]: 304/2282 cut-off events. [2024-11-20 14:01:38,874 INFO L125 PetriNetUnfolderBase]: For 1306/1398 co-relation queries the response was YES. [2024-11-20 14:01:38,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4560 conditions, 2282 events. 304/2282 cut-off events. For 1306/1398 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 18038 event pairs, 154 based on Foata normal form. 3/2224 useless extension candidates. Maximal degree in co-relation 3773. Up to 664 conditions per place. [2024-11-20 14:01:38,886 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 37 selfloop transitions, 2 changer transitions 2/279 dead transitions. [2024-11-20 14:01:38,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 279 transitions, 839 flow [2024-11-20 14:01:38,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:01:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:01:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-11-20 14:01:38,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9223918575063613 [2024-11-20 14:01:38,889 INFO L175 Difference]: Start difference. First operand has 278 places, 277 transitions, 745 flow. Second operand 3 states and 725 transitions. [2024-11-20 14:01:38,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 279 transitions, 839 flow [2024-11-20 14:01:38,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 279 transitions, 827 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 14:01:38,898 INFO L231 Difference]: Finished difference. Result has 276 places, 274 transitions, 730 flow [2024-11-20 14:01:38,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=276, PETRI_TRANSITIONS=274} [2024-11-20 14:01:38,899 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 13 predicate places. [2024-11-20 14:01:38,899 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 274 transitions, 730 flow [2024-11-20 14:01:38,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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 14:01:38,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:38,900 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:38,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 14:01:38,901 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-20 14:01:38,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:38,901 INFO L85 PathProgramCache]: Analyzing trace with hash 608177901, now seen corresponding path program 1 times [2024-11-20 14:01:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:38,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885403682] [2024-11-20 14:01:38,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:38,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:01:38,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:01:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:01:39,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:01:39,040 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:01:39,040 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2024-11-20 14:01:39,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-20 14:01:39,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-20 14:01:39,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-20 14:01:39,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-20 14:01:39,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-11-20 14:01:39,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-20 14:01:39,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-20 14:01:39,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-20 14:01:39,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-20 14:01:39,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-20 14:01:39,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-20 14:01:39,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-20 14:01:39,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-20 14:01:39,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 14:01:39,044 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:01:39,045 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 14:01:39,045 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-20 14:01:39,071 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 14:01:39,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 292 transitions, 602 flow [2024-11-20 14:01:39,147 INFO L124 PetriNetUnfolderBase]: 13/434 cut-off events. [2024-11-20 14:01:39,148 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-20 14:01:39,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 434 events. 13/434 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 581 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 358. Up to 8 conditions per place. [2024-11-20 14:01:39,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 292 transitions, 602 flow [2024-11-20 14:01:39,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 292 transitions, 602 flow [2024-11-20 14:01:39,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:01:39,153 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;@37d6213c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:01:39,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-20 14:01:39,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:01:39,168 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-20 14:01:39,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:01:39,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:01:39,169 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:01:39,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-20 14:01:39,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:01:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash -176942728, now seen corresponding path program 1 times [2024-11-20 14:01:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:01:39,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108907267] [2024-11-20 14:01:39,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:01:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:01:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:01:39,233 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 14:01:39,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:01:39,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108907267] [2024-11-20 14:01:39,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108907267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:01:39,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:01:39,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:01:39,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476047233] [2024-11-20 14:01:39,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:01:39,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:01:39,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:01:39,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:01:39,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:01:39,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 292 [2024-11-20 14:01:39,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 292 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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 14:01:39,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:01:39,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 292 [2024-11-20 14:01:39,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand