./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant-pthread.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:02:11,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:02:11,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:02:11,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:02:11,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:02:11,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:02:11,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:02:11,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:02:11,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:02:11,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:02:11,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:02:11,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:02:11,534 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:02:11,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:02:11,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:02:11,536 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:02:11,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:02:11,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:02:11,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:02:11,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:02:11,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:02:11,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:02:11,541 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:02:11,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:02:11,542 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:02:11,542 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:02:11,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:02:11,542 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:02:11,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:02:11,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:02:11,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:02:11,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:02:11,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:02:11,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:02:11,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:02:11,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:02:11,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:02:11,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:02:11,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:02:11,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:02:11,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:02:11,545 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 [2024-10-11 17:02:11,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:02:11,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:02:11,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:02:11,838 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:02:11,838 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:02:11,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant-pthread.i [2024-10-11 17:02:13,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:02:13,550 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:02:13,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant-pthread.i [2024-10-11 17:02:13,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9373f940e/c2844325883c4b38b8f99c2130e393c3/FLAG9f53793af [2024-10-11 17:02:13,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9373f940e/c2844325883c4b38b8f99c2130e393c3 [2024-10-11 17:02:13,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:02:13,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:02:13,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:02:13,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:02:13,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:02:13,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:13" (1/1) ... [2024-10-11 17:02:13,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd8c820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:13, skipping insertion in model container [2024-10-11 17:02:13,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:13" (1/1) ... [2024-10-11 17:02:13,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:02:14,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:02:14,177 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:02:14,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:02:14,286 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:02:14,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14 WrapperNode [2024-10-11 17:02:14,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:02:14,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:02:14,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:02:14,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:02:14,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14" (1/1) ... [2024-10-11 17:02:14,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14" (1/1) ... [2024-10-11 17:02:14,355 INFO L138 Inliner]: procedures = 272, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2024-10-11 17:02:14,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:02:14,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:02:14,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:02:14,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:02:14,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14" (1/1) ... [2024-10-11 17:02:14,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14" (1/1) ... [2024-10-11 17:02:14,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14" (1/1) ... [2024-10-11 17:02:14,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14" (1/1) ... [2024-10-11 17:02:14,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14" (1/1) ... [2024-10-11 17:02:14,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14" (1/1) ... [2024-10-11 17:02:14,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14" (1/1) ... [2024-10-11 17:02:14,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14" (1/1) ... [2024-10-11 17:02:14,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:02:14,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:02:14,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:02:14,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:02:14,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14" (1/1) ... [2024-10-11 17:02:14,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:02:14,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:02:14,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:02:14,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:02:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2024-10-11 17:02:14,465 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2024-10-11 17:02:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:02:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:02:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:02:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:02:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:02:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:02:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:02:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:02:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:02:14,471 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:02:14,582 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:02:14,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:02:14,821 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:02:14,821 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:02:14,843 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:02:14,844 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:02:14,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:14 BoogieIcfgContainer [2024-10-11 17:02:14,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:02:14,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:02:14,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:02:14,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:02:14,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:02:13" (1/3) ... [2024-10-11 17:02:14,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d814a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:14, skipping insertion in model container [2024-10-11 17:02:14,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:14" (2/3) ... [2024-10-11 17:02:14,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d814a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:14, skipping insertion in model container [2024-10-11 17:02:14,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:14" (3/3) ... [2024-10-11 17:02:14,851 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12_variant-pthread.i [2024-10-11 17:02:14,864 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:02:14,865 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-10-11 17:02:14,865 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:02:14,948 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:14,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 166 transitions, 336 flow [2024-10-11 17:02:15,055 INFO L124 PetriNetUnfolderBase]: 9/177 cut-off events. [2024-10-11 17:02:15,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:15,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 177 events. 9/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 143 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 98. Up to 4 conditions per place. [2024-10-11 17:02:15,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 166 transitions, 336 flow [2024-10-11 17:02:15,069 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 166 transitions, 336 flow [2024-10-11 17:02:15,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:15,088 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;@6a510c0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:15,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-10-11 17:02:15,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:15,098 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-10-11 17:02:15,098 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:15,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:15,099 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:15,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:02:15,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:15,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1268391239, now seen corresponding path program 1 times [2024-10-11 17:02:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737774072] [2024-10-11 17:02:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:15,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:15,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:15,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737774072] [2024-10-11 17:02:15,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737774072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:15,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:15,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214886542] [2024-10-11 17:02:15,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:15,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:15,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:15,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:15,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:15,615 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 166 [2024-10-11 17:02:15,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 166 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:15,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:15,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 166 [2024-10-11 17:02:15,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:15,717 INFO L124 PetriNetUnfolderBase]: 3/156 cut-off events. [2024-10-11 17:02:15,721 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:15,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 156 events. 3/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 12/147 useless extension candidates. Maximal degree in co-relation 92. Up to 11 conditions per place. [2024-10-11 17:02:15,724 INFO L140 encePairwiseOnDemand]: 157/166 looper letters, 10 selfloop transitions, 2 changer transitions 1/152 dead transitions. [2024-10-11 17:02:15,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 152 transitions, 332 flow [2024-10-11 17:02:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2024-10-11 17:02:15,752 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9116465863453815 [2024-10-11 17:02:15,755 INFO L175 Difference]: Start difference. First operand has 161 places, 166 transitions, 336 flow. Second operand 3 states and 454 transitions. [2024-10-11 17:02:15,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 152 transitions, 332 flow [2024-10-11 17:02:15,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 152 transitions, 332 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:02:15,767 INFO L231 Difference]: Finished difference. Result has 154 places, 151 transitions, 310 flow [2024-10-11 17:02:15,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=154, PETRI_TRANSITIONS=151} [2024-10-11 17:02:15,785 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, -7 predicate places. [2024-10-11 17:02:15,787 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 151 transitions, 310 flow [2024-10-11 17:02:15,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:15,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:15,789 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:15,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:02:15,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:02:15,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1403343425, now seen corresponding path program 1 times [2024-10-11 17:02:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753920145] [2024-10-11 17:02:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:15,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:15,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:15,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753920145] [2024-10-11 17:02:15,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753920145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:15,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:15,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:15,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560771340] [2024-10-11 17:02:15,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:15,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:15,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:15,965 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 166 [2024-10-11 17:02:15,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:15,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:15,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 166 [2024-10-11 17:02:15,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:16,006 INFO L124 PetriNetUnfolderBase]: 3/154 cut-off events. [2024-10-11 17:02:16,009 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:16,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 154 events. 3/154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 141. Up to 11 conditions per place. [2024-10-11 17:02:16,010 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 10 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2024-10-11 17:02:16,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 150 transitions, 332 flow [2024-10-11 17:02:16,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2024-10-11 17:02:16,016 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8995983935742972 [2024-10-11 17:02:16,016 INFO L175 Difference]: Start difference. First operand has 154 places, 151 transitions, 310 flow. Second operand 3 states and 448 transitions. [2024-10-11 17:02:16,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 150 transitions, 332 flow [2024-10-11 17:02:16,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 150 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:16,021 INFO L231 Difference]: Finished difference. Result has 152 places, 150 transitions, 308 flow [2024-10-11 17:02:16,021 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=152, PETRI_TRANSITIONS=150} [2024-10-11 17:02:16,022 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, -9 predicate places. [2024-10-11 17:02:16,022 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 150 transitions, 308 flow [2024-10-11 17:02:16,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:16,023 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,023 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:16,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:02:16,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:02:16,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2132856912, now seen corresponding path program 1 times [2024-10-11 17:02:16,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033286902] [2024-10-11 17:02:16,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033286902] [2024-10-11 17:02:16,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033286902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:16,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:16,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:16,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803939411] [2024-10-11 17:02:16,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:16,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:16,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:16,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:16,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:16,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 166 [2024-10-11 17:02:16,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 150 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:16,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:16,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 166 [2024-10-11 17:02:16,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:16,161 INFO L124 PetriNetUnfolderBase]: 3/150 cut-off events. [2024-10-11 17:02:16,163 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:02:16,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 150 events. 3/150 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 129. Up to 11 conditions per place. [2024-10-11 17:02:16,164 INFO L140 encePairwiseOnDemand]: 161/166 looper letters, 11 selfloop transitions, 1 changer transitions 0/146 dead transitions. [2024-10-11 17:02:16,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 324 flow [2024-10-11 17:02:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2024-10-11 17:02:16,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.893574297188755 [2024-10-11 17:02:16,168 INFO L175 Difference]: Start difference. First operand has 152 places, 150 transitions, 308 flow. Second operand 3 states and 445 transitions. [2024-10-11 17:02:16,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 324 flow [2024-10-11 17:02:16,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 146 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:16,175 INFO L231 Difference]: Finished difference. Result has 148 places, 146 transitions, 298 flow [2024-10-11 17:02:16,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=148, PETRI_TRANSITIONS=146} [2024-10-11 17:02:16,176 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, -13 predicate places. [2024-10-11 17:02:16,176 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 146 transitions, 298 flow [2024-10-11 17:02:16,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:16,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,177 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:16,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:02:16,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:02:16,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1413208963, now seen corresponding path program 1 times [2024-10-11 17:02:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008545908] [2024-10-11 17:02:16,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:16,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:16,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008545908] [2024-10-11 17:02:16,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008545908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:16,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:16,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:16,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10569705] [2024-10-11 17:02:16,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:16,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:16,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:16,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:16,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:16,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 166 [2024-10-11 17:02:16,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:16,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:16,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 166 [2024-10-11 17:02:16,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:16,317 INFO L124 PetriNetUnfolderBase]: 3/149 cut-off events. [2024-10-11 17:02:16,318 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:16,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 149 events. 3/149 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 126. Up to 10 conditions per place. [2024-10-11 17:02:16,319 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 9 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2024-10-11 17:02:16,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 145 transitions, 318 flow [2024-10-11 17:02:16,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2024-10-11 17:02:16,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9036144578313253 [2024-10-11 17:02:16,321 INFO L175 Difference]: Start difference. First operand has 148 places, 146 transitions, 298 flow. Second operand 3 states and 450 transitions. [2024-10-11 17:02:16,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 145 transitions, 318 flow [2024-10-11 17:02:16,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:16,323 INFO L231 Difference]: Finished difference. Result has 148 places, 145 transitions, 299 flow [2024-10-11 17:02:16,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=148, PETRI_TRANSITIONS=145} [2024-10-11 17:02:16,326 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, -13 predicate places. [2024-10-11 17:02:16,326 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 299 flow [2024-10-11 17:02:16,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:16,326 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,327 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:16,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:02:16,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:02:16,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1580768593, now seen corresponding path program 1 times [2024-10-11 17:02:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902220262] [2024-10-11 17:02:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 17:02:16,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:16,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902220262] [2024-10-11 17:02:16,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902220262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:16,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:16,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:02:16,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411009176] [2024-10-11 17:02:16,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:16,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:02:16,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:16,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:02:16,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:02:16,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 166 [2024-10-11 17:02:16,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 145 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:16,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:16,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 166 [2024-10-11 17:02:16,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:16,504 INFO L124 PetriNetUnfolderBase]: 2/152 cut-off events. [2024-10-11 17:02:16,505 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:02:16,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 152 events. 2/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 1/139 useless extension candidates. Maximal degree in co-relation 138. Up to 15 conditions per place. [2024-10-11 17:02:16,506 INFO L140 encePairwiseOnDemand]: 162/166 looper letters, 14 selfloop transitions, 0 changer transitions 4/148 dead transitions. [2024-10-11 17:02:16,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 148 transitions, 341 flow [2024-10-11 17:02:16,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:02:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:02:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 729 transitions. [2024-10-11 17:02:16,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8783132530120482 [2024-10-11 17:02:16,508 INFO L175 Difference]: Start difference. First operand has 148 places, 145 transitions, 299 flow. Second operand 5 states and 729 transitions. [2024-10-11 17:02:16,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 148 transitions, 341 flow [2024-10-11 17:02:16,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 148 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:16,511 INFO L231 Difference]: Finished difference. Result has 153 places, 144 transitions, 299 flow [2024-10-11 17:02:16,511 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=153, PETRI_TRANSITIONS=144} [2024-10-11 17:02:16,511 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, -8 predicate places. [2024-10-11 17:02:16,512 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 144 transitions, 299 flow [2024-10-11 17:02:16,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:16,512 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,513 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:16,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:02:16,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:02:16,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1178884539, now seen corresponding path program 1 times [2024-10-11 17:02:16,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447802539] [2024-10-11 17:02:16,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:16,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:02:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:16,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:02:16,582 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:02:16,584 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2024-10-11 17:02:16,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2024-10-11 17:02:16,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2024-10-11 17:02:16,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2024-10-11 17:02:16,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2024-10-11 17:02:16,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2024-10-11 17:02:16,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2024-10-11 17:02:16,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2024-10-11 17:02:16,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2024-10-11 17:02:16,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2024-10-11 17:02:16,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2024-10-11 17:02:16,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2024-10-11 17:02:16,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2024-10-11 17:02:16,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2024-10-11 17:02:16,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2024-10-11 17:02:16,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2024-10-11 17:02:16,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2024-10-11 17:02:16,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2024-10-11 17:02:16,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2024-10-11 17:02:16,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2024-10-11 17:02:16,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2024-10-11 17:02:16,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2024-10-11 17:02:16,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2024-10-11 17:02:16,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2024-10-11 17:02:16,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2024-10-11 17:02:16,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2024-10-11 17:02:16,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2024-10-11 17:02:16,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2024-10-11 17:02:16,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2024-10-11 17:02:16,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:02:16,593 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 17:02:16,595 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:02:16,596 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:02:16,661 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:16,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 252 transitions, 514 flow [2024-10-11 17:02:16,689 INFO L124 PetriNetUnfolderBase]: 15/276 cut-off events. [2024-10-11 17:02:16,689 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:02:16,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 276 events. 15/276 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 183. Up to 6 conditions per place. [2024-10-11 17:02:16,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 252 transitions, 514 flow [2024-10-11 17:02:16,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 252 transitions, 514 flow [2024-10-11 17:02:16,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:16,696 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;@6a510c0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:16,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2024-10-11 17:02:16,698 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:16,698 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-10-11 17:02:16,698 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:16,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,698 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:16,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-10-11 17:02:16,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1569155509, now seen corresponding path program 1 times [2024-10-11 17:02:16,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646560903] [2024-10-11 17:02:16,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:16,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:16,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646560903] [2024-10-11 17:02:16,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646560903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:16,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:16,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:16,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173938088] [2024-10-11 17:02:16,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:16,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:16,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:16,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:16,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:16,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 252 [2024-10-11 17:02:16,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 252 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:16,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:16,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 252 [2024-10-11 17:02:16,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:16,907 INFO L124 PetriNetUnfolderBase]: 61/810 cut-off events. [2024-10-11 17:02:16,911 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-11 17:02:16,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 810 events. 61/810 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4573 event pairs, 42 based on Foata normal form. 91/768 useless extension candidates. Maximal degree in co-relation 736. Up to 102 conditions per place. [2024-10-11 17:02:16,927 INFO L140 encePairwiseOnDemand]: 240/252 looper letters, 17 selfloop transitions, 2 changer transitions 1/233 dead transitions. [2024-10-11 17:02:16,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 233 transitions, 514 flow [2024-10-11 17:02:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2024-10-11 17:02:16,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9113756613756614 [2024-10-11 17:02:16,929 INFO L175 Difference]: Start difference. First operand has 244 places, 252 transitions, 514 flow. Second operand 3 states and 689 transitions. [2024-10-11 17:02:16,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 233 transitions, 514 flow [2024-10-11 17:02:16,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 233 transitions, 514 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:02:16,937 INFO L231 Difference]: Finished difference. Result has 235 places, 232 transitions, 478 flow [2024-10-11 17:02:16,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=235, PETRI_TRANSITIONS=232} [2024-10-11 17:02:16,938 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -9 predicate places. [2024-10-11 17:02:16,938 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 232 transitions, 478 flow [2024-10-11 17:02:16,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:16,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:16,942 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:16,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:02:16,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-10-11 17:02:16,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:16,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1099319873, now seen corresponding path program 1 times [2024-10-11 17:02:16,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:16,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127703530] [2024-10-11 17:02:16,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:16,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-10-11 17:02:16,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:16,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127703530] [2024-10-11 17:02:16,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127703530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:16,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:16,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:16,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495064360] [2024-10-11 17:02:16,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:16,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:16,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:16,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:16,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:17,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 252 [2024-10-11 17:02:17,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 232 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:17,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:17,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 252 [2024-10-11 17:02:17,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:17,060 INFO L124 PetriNetUnfolderBase]: 25/553 cut-off events. [2024-10-11 17:02:17,060 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-11 17:02:17,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 553 events. 25/553 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2463 event pairs, 12 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 580. Up to 39 conditions per place. [2024-10-11 17:02:17,065 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 14 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2024-10-11 17:02:17,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 231 transitions, 508 flow [2024-10-11 17:02:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2024-10-11 17:02:17,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9074074074074074 [2024-10-11 17:02:17,069 INFO L175 Difference]: Start difference. First operand has 235 places, 232 transitions, 478 flow. Second operand 3 states and 686 transitions. [2024-10-11 17:02:17,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 231 transitions, 508 flow [2024-10-11 17:02:17,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 231 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:17,072 INFO L231 Difference]: Finished difference. Result has 233 places, 231 transitions, 476 flow [2024-10-11 17:02:17,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=233, PETRI_TRANSITIONS=231} [2024-10-11 17:02:17,073 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -11 predicate places. [2024-10-11 17:02:17,074 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 231 transitions, 476 flow [2024-10-11 17:02:17,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:17,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:17,076 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:17,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:02:17,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-10-11 17:02:17,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash 637175472, now seen corresponding path program 1 times [2024-10-11 17:02:17,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:17,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870296509] [2024-10-11 17:02:17,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:17,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:17,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870296509] [2024-10-11 17:02:17,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870296509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:17,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:17,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:17,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077716373] [2024-10-11 17:02:17,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:17,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:17,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:17,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:17,123 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 252 [2024-10-11 17:02:17,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 231 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:17,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:17,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 252 [2024-10-11 17:02:17,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:17,239 INFO L124 PetriNetUnfolderBase]: 39/750 cut-off events. [2024-10-11 17:02:17,239 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-11 17:02:17,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 750 events. 39/750 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4164 event pairs, 20 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 789. Up to 56 conditions per place. [2024-10-11 17:02:17,244 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 16 selfloop transitions, 1 changer transitions 0/226 dead transitions. [2024-10-11 17:02:17,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 226 transitions, 500 flow [2024-10-11 17:02:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-10-11 17:02:17,246 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8981481481481481 [2024-10-11 17:02:17,246 INFO L175 Difference]: Start difference. First operand has 233 places, 231 transitions, 476 flow. Second operand 3 states and 679 transitions. [2024-10-11 17:02:17,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 226 transitions, 500 flow [2024-10-11 17:02:17,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 226 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:17,250 INFO L231 Difference]: Finished difference. Result has 228 places, 226 transitions, 464 flow [2024-10-11 17:02:17,250 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=228, PETRI_TRANSITIONS=226} [2024-10-11 17:02:17,252 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -16 predicate places. [2024-10-11 17:02:17,252 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 464 flow [2024-10-11 17:02:17,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:17,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:17,253 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:17,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:02:17,254 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-10-11 17:02:17,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:17,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1559604867, now seen corresponding path program 1 times [2024-10-11 17:02:17,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:17,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659860595] [2024-10-11 17:02:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:17,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:17,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:17,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659860595] [2024-10-11 17:02:17,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659860595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:17,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:17,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:17,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067305885] [2024-10-11 17:02:17,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:17,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:17,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:17,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:17,332 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 252 [2024-10-11 17:02:17,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 226 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:17,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:17,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 252 [2024-10-11 17:02:17,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:17,407 INFO L124 PetriNetUnfolderBase]: 47/709 cut-off events. [2024-10-11 17:02:17,407 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-11 17:02:17,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 709 events. 47/709 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3547 event pairs, 30 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 770. Up to 76 conditions per place. [2024-10-11 17:02:17,412 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 15 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2024-10-11 17:02:17,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 225 transitions, 496 flow [2024-10-11 17:02:17,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 684 transitions. [2024-10-11 17:02:17,415 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-10-11 17:02:17,415 INFO L175 Difference]: Start difference. First operand has 228 places, 226 transitions, 464 flow. Second operand 3 states and 684 transitions. [2024-10-11 17:02:17,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 225 transitions, 496 flow [2024-10-11 17:02:17,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 225 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:17,419 INFO L231 Difference]: Finished difference. Result has 228 places, 225 transitions, 465 flow [2024-10-11 17:02:17,419 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=465, PETRI_PLACES=228, PETRI_TRANSITIONS=225} [2024-10-11 17:02:17,420 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -16 predicate places. [2024-10-11 17:02:17,420 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 225 transitions, 465 flow [2024-10-11 17:02:17,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:17,421 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:17,421 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:17,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:02:17,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-10-11 17:02:17,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash 10352380, now seen corresponding path program 1 times [2024-10-11 17:02:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458746193] [2024-10-11 17:02:17,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:17,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:17,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458746193] [2024-10-11 17:02:17,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458746193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:17,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:17,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:17,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404705000] [2024-10-11 17:02:17,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:17,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:17,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:17,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:17,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:17,502 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 252 [2024-10-11 17:02:17,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 225 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:17,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:17,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 252 [2024-10-11 17:02:17,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:17,708 INFO L124 PetriNetUnfolderBase]: 164/2096 cut-off events. [2024-10-11 17:02:17,708 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-11 17:02:17,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2426 conditions, 2096 events. 164/2096 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 17325 event pairs, 57 based on Foata normal form. 0/1792 useless extension candidates. Maximal degree in co-relation 2384. Up to 204 conditions per place. [2024-10-11 17:02:17,721 INFO L140 encePairwiseOnDemand]: 232/252 looper letters, 32 selfloop transitions, 14 changer transitions 0/244 dead transitions. [2024-10-11 17:02:17,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 244 transitions, 600 flow [2024-10-11 17:02:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2024-10-11 17:02:17,724 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.917989417989418 [2024-10-11 17:02:17,724 INFO L175 Difference]: Start difference. First operand has 228 places, 225 transitions, 465 flow. Second operand 3 states and 694 transitions. [2024-10-11 17:02:17,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 244 transitions, 600 flow [2024-10-11 17:02:17,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 244 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:17,728 INFO L231 Difference]: Finished difference. Result has 230 places, 239 transitions, 585 flow [2024-10-11 17:02:17,728 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=585, PETRI_PLACES=230, PETRI_TRANSITIONS=239} [2024-10-11 17:02:17,729 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -14 predicate places. [2024-10-11 17:02:17,729 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 239 transitions, 585 flow [2024-10-11 17:02:17,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:17,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:17,730 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:17,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:02:17,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-10-11 17:02:17,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:17,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1324832269, now seen corresponding path program 1 times [2024-10-11 17:02:17,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:17,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073115462] [2024-10-11 17:02:17,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:17,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 17:02:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073115462] [2024-10-11 17:02:17,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073115462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:17,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:17,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:02:17,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430665578] [2024-10-11 17:02:17,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:17,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:02:17,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:17,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:02:17,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:02:17,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 252 [2024-10-11 17:02:17,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 239 transitions, 585 flow. Second operand has 5 states, 5 states have (on average 223.4) internal successors, (1117), 5 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:17,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:17,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 252 [2024-10-11 17:02:17,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:18,043 INFO L124 PetriNetUnfolderBase]: 99/1993 cut-off events. [2024-10-11 17:02:18,043 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-10-11 17:02:18,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 1993 events. 99/1993 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 16303 event pairs, 41 based on Foata normal form. 1/1705 useless extension candidates. Maximal degree in co-relation 2223. Up to 120 conditions per place. [2024-10-11 17:02:18,056 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 17 selfloop transitions, 0 changer transitions 4/242 dead transitions. [2024-10-11 17:02:18,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 242 transitions, 633 flow [2024-10-11 17:02:18,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:02:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:02:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1127 transitions. [2024-10-11 17:02:18,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944444444444445 [2024-10-11 17:02:18,059 INFO L175 Difference]: Start difference. First operand has 230 places, 239 transitions, 585 flow. Second operand 5 states and 1127 transitions. [2024-10-11 17:02:18,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 242 transitions, 633 flow [2024-10-11 17:02:18,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 242 transitions, 605 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:18,065 INFO L231 Difference]: Finished difference. Result has 235 places, 238 transitions, 561 flow [2024-10-11 17:02:18,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=561, PETRI_PLACES=235, PETRI_TRANSITIONS=238} [2024-10-11 17:02:18,065 INFO L277 CegarLoopForPetriNet]: 244 programPoint places, -9 predicate places. [2024-10-11 17:02:18,066 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 238 transitions, 561 flow [2024-10-11 17:02:18,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 223.4) internal successors, (1117), 5 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:18,066 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:18,067 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:18,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:02:18,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2024-10-11 17:02:18,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1086016417, now seen corresponding path program 1 times [2024-10-11 17:02:18,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:18,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460043539] [2024-10-11 17:02:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:18,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:18,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:02:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:18,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:02:18,098 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:02:18,098 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2024-10-11 17:02:18,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2024-10-11 17:02:18,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2024-10-11 17:02:18,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2024-10-11 17:02:18,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2024-10-11 17:02:18,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2024-10-11 17:02:18,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2024-10-11 17:02:18,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2024-10-11 17:02:18,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2024-10-11 17:02:18,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2024-10-11 17:02:18,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2024-10-11 17:02:18,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2024-10-11 17:02:18,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2024-10-11 17:02:18,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2024-10-11 17:02:18,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2024-10-11 17:02:18,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2024-10-11 17:02:18,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2024-10-11 17:02:18,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2024-10-11 17:02:18,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2024-10-11 17:02:18,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2024-10-11 17:02:18,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2024-10-11 17:02:18,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2024-10-11 17:02:18,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2024-10-11 17:02:18,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2024-10-11 17:02:18,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2024-10-11 17:02:18,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2024-10-11 17:02:18,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2024-10-11 17:02:18,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2024-10-11 17:02:18,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2024-10-11 17:02:18,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2024-10-11 17:02:18,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2024-10-11 17:02:18,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2024-10-11 17:02:18,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2024-10-11 17:02:18,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2024-10-11 17:02:18,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2024-10-11 17:02:18,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2024-10-11 17:02:18,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2024-10-11 17:02:18,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2024-10-11 17:02:18,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2024-10-11 17:02:18,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2024-10-11 17:02:18,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:02:18,105 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:18,106 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:02:18,106 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 17:02:18,147 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:18,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 338 transitions, 694 flow [2024-10-11 17:02:18,194 INFO L124 PetriNetUnfolderBase]: 21/375 cut-off events. [2024-10-11 17:02:18,194 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:02:18,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 375 events. 21/375 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1016 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 280. Up to 8 conditions per place. [2024-10-11 17:02:18,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 338 transitions, 694 flow [2024-10-11 17:02:18,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 327 places, 338 transitions, 694 flow [2024-10-11 17:02:18,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:18,203 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;@6a510c0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:18,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-10-11 17:02:18,204 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:18,204 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-10-11 17:02:18,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:18,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:18,205 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:18,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:02:18,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:18,205 INFO L85 PathProgramCache]: Analyzing trace with hash 773320711, now seen corresponding path program 1 times [2024-10-11 17:02:18,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:18,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614930456] [2024-10-11 17:02:18,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:18,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:18,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:18,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614930456] [2024-10-11 17:02:18,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614930456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:18,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:18,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:18,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506922077] [2024-10-11 17:02:18,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:18,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:18,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:18,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:18,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:18,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 338 [2024-10-11 17:02:18,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 338 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:18,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:18,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 338 [2024-10-11 17:02:18,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:19,418 INFO L124 PetriNetUnfolderBase]: 763/5685 cut-off events. [2024-10-11 17:02:19,419 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2024-10-11 17:02:19,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6943 conditions, 5685 events. 763/5685 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 60119 event pairs, 630 based on Foata normal form. 701/5455 useless extension candidates. Maximal degree in co-relation 5718. Up to 1033 conditions per place. [2024-10-11 17:02:19,466 INFO L140 encePairwiseOnDemand]: 323/338 looper letters, 24 selfloop transitions, 2 changer transitions 1/314 dead transitions. [2024-10-11 17:02:19,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 314 transitions, 698 flow [2024-10-11 17:02:19,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-10-11 17:02:19,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9112426035502958 [2024-10-11 17:02:19,468 INFO L175 Difference]: Start difference. First operand has 327 places, 338 transitions, 694 flow. Second operand 3 states and 924 transitions. [2024-10-11 17:02:19,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 314 transitions, 698 flow [2024-10-11 17:02:19,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 314 transitions, 696 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-11 17:02:19,474 INFO L231 Difference]: Finished difference. Result has 316 places, 313 transitions, 646 flow [2024-10-11 17:02:19,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=316, PETRI_TRANSITIONS=313} [2024-10-11 17:02:19,475 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -11 predicate places. [2024-10-11 17:02:19,475 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 313 transitions, 646 flow [2024-10-11 17:02:19,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:19,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:19,476 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:19,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:02:19,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:02:19,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:19,476 INFO L85 PathProgramCache]: Analyzing trace with hash -24285631, now seen corresponding path program 1 times [2024-10-11 17:02:19,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:19,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294033499] [2024-10-11 17:02:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:19,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:19,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:19,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294033499] [2024-10-11 17:02:19,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294033499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:19,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:19,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962443261] [2024-10-11 17:02:19,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:19,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:19,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:19,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:19,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:19,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 338 [2024-10-11 17:02:19,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 313 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:19,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:19,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 338 [2024-10-11 17:02:19,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:19,795 INFO L124 PetriNetUnfolderBase]: 163/2236 cut-off events. [2024-10-11 17:02:19,795 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-10-11 17:02:19,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 2236 events. 163/2236 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 18949 event pairs, 108 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 2471. Up to 199 conditions per place. [2024-10-11 17:02:19,812 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 18 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2024-10-11 17:02:19,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 312 transitions, 684 flow [2024-10-11 17:02:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:19,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2024-10-11 17:02:19,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9112426035502958 [2024-10-11 17:02:19,814 INFO L175 Difference]: Start difference. First operand has 316 places, 313 transitions, 646 flow. Second operand 3 states and 924 transitions. [2024-10-11 17:02:19,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 312 transitions, 684 flow [2024-10-11 17:02:19,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 312 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:19,818 INFO L231 Difference]: Finished difference. Result has 314 places, 312 transitions, 644 flow [2024-10-11 17:02:19,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=314, PETRI_TRANSITIONS=312} [2024-10-11 17:02:19,819 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -13 predicate places. [2024-10-11 17:02:19,819 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 312 transitions, 644 flow [2024-10-11 17:02:19,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:19,820 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:19,820 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:19,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:02:19,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:02:19,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:19,821 INFO L85 PathProgramCache]: Analyzing trace with hash 57569072, now seen corresponding path program 1 times [2024-10-11 17:02:19,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:19,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999138169] [2024-10-11 17:02:19,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:19,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:19,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999138169] [2024-10-11 17:02:19,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999138169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:19,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:19,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894131323] [2024-10-11 17:02:19,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:19,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:19,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:19,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:19,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:19,884 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 338 [2024-10-11 17:02:19,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 312 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:19,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:19,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 338 [2024-10-11 17:02:19,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:20,327 INFO L124 PetriNetUnfolderBase]: 325/4000 cut-off events. [2024-10-11 17:02:20,328 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-10-11 17:02:20,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 4000 events. 325/4000 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 40765 event pairs, 220 based on Foata normal form. 0/3343 useless extension candidates. Maximal degree in co-relation 4439. Up to 381 conditions per place. [2024-10-11 17:02:20,362 INFO L140 encePairwiseOnDemand]: 331/338 looper letters, 21 selfloop transitions, 1 changer transitions 0/306 dead transitions. [2024-10-11 17:02:20,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 306 transitions, 676 flow [2024-10-11 17:02:20,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2024-10-11 17:02:20,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9003944773175543 [2024-10-11 17:02:20,365 INFO L175 Difference]: Start difference. First operand has 314 places, 312 transitions, 644 flow. Second operand 3 states and 913 transitions. [2024-10-11 17:02:20,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 306 transitions, 676 flow [2024-10-11 17:02:20,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 306 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:20,370 INFO L231 Difference]: Finished difference. Result has 308 places, 306 transitions, 630 flow [2024-10-11 17:02:20,370 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=308, PETRI_TRANSITIONS=306} [2024-10-11 17:02:20,371 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -19 predicate places. [2024-10-11 17:02:20,371 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 306 transitions, 630 flow [2024-10-11 17:02:20,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:20,372 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:20,372 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:20,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:02:20,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:02:20,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash 767437059, now seen corresponding path program 1 times [2024-10-11 17:02:20,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:20,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724420905] [2024-10-11 17:02:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:20,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:20,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:20,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724420905] [2024-10-11 17:02:20,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724420905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:20,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:20,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:20,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105199256] [2024-10-11 17:02:20,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:20,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:20,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:20,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:20,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:20,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 338 [2024-10-11 17:02:20,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 306 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:20,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:20,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 338 [2024-10-11 17:02:20,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:20,920 INFO L124 PetriNetUnfolderBase]: 493/4263 cut-off events. [2024-10-11 17:02:20,921 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-10-11 17:02:20,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 4263 events. 493/4263 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 40930 event pairs, 390 based on Foata normal form. 0/3578 useless extension candidates. Maximal degree in co-relation 5008. Up to 652 conditions per place. [2024-10-11 17:02:20,950 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 21 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2024-10-11 17:02:20,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 305 transitions, 674 flow [2024-10-11 17:02:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions. [2024-10-11 17:02:20,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9053254437869822 [2024-10-11 17:02:20,953 INFO L175 Difference]: Start difference. First operand has 308 places, 306 transitions, 630 flow. Second operand 3 states and 918 transitions. [2024-10-11 17:02:20,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 305 transitions, 674 flow [2024-10-11 17:02:20,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 305 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:20,957 INFO L231 Difference]: Finished difference. Result has 308 places, 305 transitions, 631 flow [2024-10-11 17:02:20,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=308, PETRI_TRANSITIONS=305} [2024-10-11 17:02:20,958 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -19 predicate places. [2024-10-11 17:02:20,958 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 305 transitions, 631 flow [2024-10-11 17:02:20,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:20,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:20,959 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:20,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:02:20,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:02:20,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1159103246, now seen corresponding path program 1 times [2024-10-11 17:02:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:20,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987109347] [2024-10-11 17:02:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:20,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:20,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:20,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987109347] [2024-10-11 17:02:20,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987109347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:20,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:20,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:20,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58464688] [2024-10-11 17:02:20,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:20,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:20,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:20,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:21,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 338 [2024-10-11 17:02:21,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 305 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:21,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:21,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 338 [2024-10-11 17:02:21,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:24,356 INFO L124 PetriNetUnfolderBase]: 4201/31332 cut-off events. [2024-10-11 17:02:24,356 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2024-10-11 17:02:24,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37791 conditions, 31332 events. 4201/31332 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 462096 event pairs, 1667 based on Foata normal form. 0/26532 useless extension candidates. Maximal degree in co-relation 37748. Up to 4132 conditions per place. [2024-10-11 17:02:24,973 INFO L140 encePairwiseOnDemand]: 308/338 looper letters, 48 selfloop transitions, 21 changer transitions 0/334 dead transitions. [2024-10-11 17:02:24,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 334 transitions, 837 flow [2024-10-11 17:02:24,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 927 transitions. [2024-10-11 17:02:24,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9142011834319527 [2024-10-11 17:02:24,975 INFO L175 Difference]: Start difference. First operand has 308 places, 305 transitions, 631 flow. Second operand 3 states and 927 transitions. [2024-10-11 17:02:24,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 334 transitions, 837 flow [2024-10-11 17:02:24,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 334 transitions, 833 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:24,983 INFO L231 Difference]: Finished difference. Result has 310 places, 326 transitions, 813 flow [2024-10-11 17:02:24,983 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=310, PETRI_TRANSITIONS=326} [2024-10-11 17:02:24,984 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -17 predicate places. [2024-10-11 17:02:24,984 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 326 transitions, 813 flow [2024-10-11 17:02:24,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:24,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:24,985 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:24,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:02:24,985 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:02:24,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:24,986 INFO L85 PathProgramCache]: Analyzing trace with hash 16886909, now seen corresponding path program 1 times [2024-10-11 17:02:24,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:24,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505231670] [2024-10-11 17:02:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:24,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:25,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:25,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505231670] [2024-10-11 17:02:25,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505231670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:25,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:25,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:02:25,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433631809] [2024-10-11 17:02:25,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:25,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:02:25,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:25,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:02:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:02:25,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 338 [2024-10-11 17:02:25,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 326 transitions, 813 flow. Second operand has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:25,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:25,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 338 [2024-10-11 17:02:25,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:26,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [326#true, 338#(= |#race~len~0| 0), 324#true, 347#true, 110#L1043-3true, Black: 342#true, 328#true, 344#(= |#race~next~0| 0), 155#L1045-2true, 270#L1045-2true, 92#L1061-4true]) [2024-10-11 17:02:26,591 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-10-11 17:02:26,591 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-10-11 17:02:26,591 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-11 17:02:26,591 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-11 17:02:27,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [326#true, 338#(= |#race~len~0| 0), 324#true, 347#true, 110#L1043-3true, Black: 344#(= |#race~next~0| 0), 328#true, 155#L1045-2true, 270#L1045-2true, 92#L1061-4true, 342#true]) [2024-10-11 17:02:27,589 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-11 17:02:27,589 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-11 17:02:27,589 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-11 17:02:27,589 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-11 17:02:27,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [326#true, 338#(= |#race~len~0| 0), 324#true, 347#true, Black: 344#(= |#race~next~0| 0), 328#true, 284#L1043-1true, 155#L1045-2true, 270#L1045-2true, 92#L1061-4true, 342#true]) [2024-10-11 17:02:27,605 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-10-11 17:02:27,605 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-11 17:02:27,605 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-11 17:02:27,606 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-11 17:02:27,692 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1156] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [326#true, 338#(= |#race~len~0| 0), 324#true, 347#true, 110#L1043-3true, Black: 344#(= |#race~next~0| 0), 328#true, 155#L1045-2true, 270#L1045-2true, 92#L1061-4true, 342#true]) [2024-10-11 17:02:27,693 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-11 17:02:27,693 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-11 17:02:27,693 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-11 17:02:27,693 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-11 17:02:27,693 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-11 17:02:27,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [326#true, 338#(= |#race~len~0| 0), 324#true, 347#true, Black: 344#(= |#race~next~0| 0), 328#true, 155#L1045-2true, 216#L1043-2true, 270#L1045-2true, 92#L1061-4true, 342#true]) [2024-10-11 17:02:27,694 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2024-10-11 17:02:27,694 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:02:27,694 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-11 17:02:27,694 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-11 17:02:29,592 INFO L124 PetriNetUnfolderBase]: 3431/36137 cut-off events. [2024-10-11 17:02:29,593 INFO L125 PetriNetUnfolderBase]: For 1029/1059 co-relation queries the response was YES. [2024-10-11 17:02:29,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43394 conditions, 36137 events. 3431/36137 cut-off events. For 1029/1059 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 561709 event pairs, 1656 based on Foata normal form. 59/30940 useless extension candidates. Maximal degree in co-relation 43351. Up to 3075 conditions per place. [2024-10-11 17:02:30,077 INFO L140 encePairwiseOnDemand]: 334/338 looper letters, 27 selfloop transitions, 3 changer transitions 0/339 dead transitions. [2024-10-11 17:02:30,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 339 transitions, 919 flow [2024-10-11 17:02:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:02:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 17:02:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1255 transitions. [2024-10-11 17:02:30,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9282544378698225 [2024-10-11 17:02:30,081 INFO L175 Difference]: Start difference. First operand has 310 places, 326 transitions, 813 flow. Second operand 4 states and 1255 transitions. [2024-10-11 17:02:30,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 339 transitions, 919 flow [2024-10-11 17:02:30,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 339 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:30,099 INFO L231 Difference]: Finished difference. Result has 312 places, 326 transitions, 781 flow [2024-10-11 17:02:30,099 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=781, PETRI_PLACES=312, PETRI_TRANSITIONS=326} [2024-10-11 17:02:30,100 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -15 predicate places. [2024-10-11 17:02:30,100 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 326 transitions, 781 flow [2024-10-11 17:02:30,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:30,100 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:30,100 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:30,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:02:30,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:02:30,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:30,101 INFO L85 PathProgramCache]: Analyzing trace with hash -201069650, now seen corresponding path program 1 times [2024-10-11 17:02:30,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:30,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702207981] [2024-10-11 17:02:30,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:30,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 17:02:30,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:30,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702207981] [2024-10-11 17:02:30,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702207981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:30,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:30,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:02:30,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243653904] [2024-10-11 17:02:30,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:30,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:02:30,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:30,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:02:30,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:02:30,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 338 [2024-10-11 17:02:30,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 326 transitions, 781 flow. Second operand has 5 states, 5 states have (on average 302.6) internal successors, (1513), 5 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:30,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:30,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 338 [2024-10-11 17:02:30,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:31,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1071] L1041-6-->L1045-2: Formula: (and (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][148], [326#true, 338#(= |#race~len~0| 0), 324#true, 347#true, 328#true, 352#true, Black: 342#true, 290#L1043-6true, 155#L1045-2true, 92#L1061-4true, 270#L1045-2true, Black: 350#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0))]) [2024-10-11 17:02:31,328 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2024-10-11 17:02:31,328 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-11 17:02:31,328 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-11 17:02:31,328 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-11 17:02:31,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][115], [326#true, 350#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 338#(= |#race~len~0| 0), 324#true, 241#L1045-2true, Black: 344#(= |#race~next~0| 0), 352#true, 328#true, 155#L1045-2true, 270#L1045-2true, 92#L1061-4true]) [2024-10-11 17:02:31,410 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-10-11 17:02:31,410 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-11 17:02:31,410 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-11 17:02:31,410 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-11 17:02:32,748 INFO L124 PetriNetUnfolderBase]: 2233/24093 cut-off events. [2024-10-11 17:02:32,749 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-10-11 17:02:32,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28138 conditions, 24093 events. 2233/24093 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 353759 event pairs, 1151 based on Foata normal form. 1/20432 useless extension candidates. Maximal degree in co-relation 28093. Up to 2300 conditions per place. [2024-10-11 17:02:32,981 INFO L140 encePairwiseOnDemand]: 334/338 looper letters, 20 selfloop transitions, 0 changer transitions 4/329 dead transitions. [2024-10-11 17:02:32,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 329 transitions, 835 flow [2024-10-11 17:02:32,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:02:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:02:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1525 transitions. [2024-10-11 17:02:32,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9023668639053254 [2024-10-11 17:02:32,988 INFO L175 Difference]: Start difference. First operand has 312 places, 326 transitions, 781 flow. Second operand 5 states and 1525 transitions. [2024-10-11 17:02:32,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 329 transitions, 835 flow [2024-10-11 17:02:32,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 329 transitions, 829 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 17:02:32,993 INFO L231 Difference]: Finished difference. Result has 316 places, 325 transitions, 779 flow [2024-10-11 17:02:32,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=779, PETRI_PLACES=316, PETRI_TRANSITIONS=325} [2024-10-11 17:02:32,994 INFO L277 CegarLoopForPetriNet]: 327 programPoint places, -11 predicate places. [2024-10-11 17:02:32,994 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 325 transitions, 779 flow [2024-10-11 17:02:32,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 302.6) internal successors, (1513), 5 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:32,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:32,995 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:32,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:02:32,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:02:32,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash 407754066, now seen corresponding path program 1 times [2024-10-11 17:02:32,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:32,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124439957] [2024-10-11 17:02:32,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:32,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:33,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:02:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:33,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:02:33,035 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:02:33,035 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2024-10-11 17:02:33,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2024-10-11 17:02:33,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2024-10-11 17:02:33,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2024-10-11 17:02:33,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2024-10-11 17:02:33,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2024-10-11 17:02:33,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2024-10-11 17:02:33,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2024-10-11 17:02:33,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2024-10-11 17:02:33,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2024-10-11 17:02:33,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2024-10-11 17:02:33,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2024-10-11 17:02:33,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2024-10-11 17:02:33,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2024-10-11 17:02:33,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2024-10-11 17:02:33,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2024-10-11 17:02:33,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2024-10-11 17:02:33,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2024-10-11 17:02:33,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2024-10-11 17:02:33,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2024-10-11 17:02:33,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2024-10-11 17:02:33,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2024-10-11 17:02:33,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2024-10-11 17:02:33,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2024-10-11 17:02:33,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2024-10-11 17:02:33,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2024-10-11 17:02:33,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2024-10-11 17:02:33,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2024-10-11 17:02:33,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2024-10-11 17:02:33,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2024-10-11 17:02:33,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2024-10-11 17:02:33,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2024-10-11 17:02:33,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2024-10-11 17:02:33,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2024-10-11 17:02:33,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2024-10-11 17:02:33,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2024-10-11 17:02:33,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2024-10-11 17:02:33,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2024-10-11 17:02:33,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2024-10-11 17:02:33,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2024-10-11 17:02:33,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2024-10-11 17:02:33,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2024-10-11 17:02:33,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2024-10-11 17:02:33,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2024-10-11 17:02:33,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2024-10-11 17:02:33,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2024-10-11 17:02:33,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2024-10-11 17:02:33,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2024-10-11 17:02:33,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2024-10-11 17:02:33,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2024-10-11 17:02:33,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2024-10-11 17:02:33,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:02:33,043 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:33,043 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:02:33,044 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-11 17:02:33,091 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:33,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 410 places, 424 transitions, 876 flow [2024-10-11 17:02:33,151 INFO L124 PetriNetUnfolderBase]: 27/474 cut-off events. [2024-10-11 17:02:33,151 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 17:02:33,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 474 events. 27/474 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1569 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 383. Up to 10 conditions per place. [2024-10-11 17:02:33,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 410 places, 424 transitions, 876 flow [2024-10-11 17:02:33,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 410 places, 424 transitions, 876 flow [2024-10-11 17:02:33,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:33,161 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;@6a510c0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:33,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-10-11 17:02:33,163 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:33,163 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-10-11 17:02:33,164 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:33,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:33,164 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:33,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2024-10-11 17:02:33,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:33,164 INFO L85 PathProgramCache]: Analyzing trace with hash 639071663, now seen corresponding path program 1 times [2024-10-11 17:02:33,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:33,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610690372] [2024-10-11 17:02:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:33,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:33,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:33,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610690372] [2024-10-11 17:02:33,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610690372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:33,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:33,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:33,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651540361] [2024-10-11 17:02:33,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:33,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:33,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:33,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:33,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:33,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 424 [2024-10-11 17:02:33,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 424 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:33,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:33,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 424 [2024-10-11 17:02:33,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:38,840 INFO L124 PetriNetUnfolderBase]: 7737/41871 cut-off events. [2024-10-11 17:02:38,840 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2024-10-11 17:02:39,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53420 conditions, 41871 events. 7737/41871 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1133. Compared 611898 event pairs, 6804 based on Foata normal form. 5588/40928 useless extension candidates. Maximal degree in co-relation 44090. Up to 9608 conditions per place. [2024-10-11 17:02:39,622 INFO L140 encePairwiseOnDemand]: 406/424 looper letters, 31 selfloop transitions, 2 changer transitions 1/395 dead transitions. [2024-10-11 17:02:39,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 395 transitions, 884 flow [2024-10-11 17:02:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1159 transitions. [2024-10-11 17:02:39,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9111635220125787 [2024-10-11 17:02:39,625 INFO L175 Difference]: Start difference. First operand has 410 places, 424 transitions, 876 flow. Second operand 3 states and 1159 transitions. [2024-10-11 17:02:39,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 395 transitions, 884 flow [2024-10-11 17:02:39,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 395 transitions, 878 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-11 17:02:39,630 INFO L231 Difference]: Finished difference. Result has 397 places, 394 transitions, 814 flow [2024-10-11 17:02:39,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=397, PETRI_TRANSITIONS=394} [2024-10-11 17:02:39,631 INFO L277 CegarLoopForPetriNet]: 410 programPoint places, -13 predicate places. [2024-10-11 17:02:39,631 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 394 transitions, 814 flow [2024-10-11 17:02:39,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:39,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:39,631 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:39,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:02:39,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2024-10-11 17:02:39,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:39,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1967473087, now seen corresponding path program 1 times [2024-10-11 17:02:39,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:39,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025585062] [2024-10-11 17:02:39,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:39,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:39,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:39,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025585062] [2024-10-11 17:02:39,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025585062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:39,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:39,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:39,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144926891] [2024-10-11 17:02:39,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:39,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:39,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:39,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:39,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:39,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 424 [2024-10-11 17:02:39,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 394 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:39,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:39,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 424 [2024-10-11 17:02:39,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:40,743 INFO L124 PetriNetUnfolderBase]: 909/9199 cut-off events. [2024-10-11 17:02:40,744 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-10-11 17:02:40,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10494 conditions, 9199 events. 909/9199 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 110277 event pairs, 684 based on Foata normal form. 0/7626 useless extension candidates. Maximal degree in co-relation 10458. Up to 1031 conditions per place. [2024-10-11 17:02:40,864 INFO L140 encePairwiseOnDemand]: 421/424 looper letters, 22 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2024-10-11 17:02:40,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 393 transitions, 860 flow [2024-10-11 17:02:40,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1162 transitions. [2024-10-11 17:02:40,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9135220125786163 [2024-10-11 17:02:40,868 INFO L175 Difference]: Start difference. First operand has 397 places, 394 transitions, 814 flow. Second operand 3 states and 1162 transitions. [2024-10-11 17:02:40,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 393 transitions, 860 flow [2024-10-11 17:02:40,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 393 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:40,873 INFO L231 Difference]: Finished difference. Result has 395 places, 393 transitions, 812 flow [2024-10-11 17:02:40,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=395, PETRI_TRANSITIONS=393} [2024-10-11 17:02:40,874 INFO L277 CegarLoopForPetriNet]: 410 programPoint places, -15 predicate places. [2024-10-11 17:02:40,874 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 393 transitions, 812 flow [2024-10-11 17:02:40,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:40,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:40,874 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:40,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:02:40,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2024-10-11 17:02:40,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash 423291184, now seen corresponding path program 1 times [2024-10-11 17:02:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164046596] [2024-10-11 17:02:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:40,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:40,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164046596] [2024-10-11 17:02:40,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164046596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:40,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:40,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:40,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541356162] [2024-10-11 17:02:40,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:40,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:40,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:40,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:40,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:40,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 424 [2024-10-11 17:02:40,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 393 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:40,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:40,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 424 [2024-10-11 17:02:40,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:43,455 INFO L124 PetriNetUnfolderBase]: 2261/20900 cut-off events. [2024-10-11 17:02:43,455 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2024-10-11 17:02:43,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23883 conditions, 20900 events. 2261/20900 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 295599 event pairs, 1720 based on Foata normal form. 0/17502 useless extension candidates. Maximal degree in co-relation 23839. Up to 2506 conditions per place. [2024-10-11 17:02:43,718 INFO L140 encePairwiseOnDemand]: 416/424 looper letters, 26 selfloop transitions, 1 changer transitions 0/386 dead transitions. [2024-10-11 17:02:43,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 386 transitions, 852 flow [2024-10-11 17:02:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1147 transitions. [2024-10-11 17:02:43,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9017295597484277 [2024-10-11 17:02:43,721 INFO L175 Difference]: Start difference. First operand has 395 places, 393 transitions, 812 flow. Second operand 3 states and 1147 transitions. [2024-10-11 17:02:43,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 386 transitions, 852 flow [2024-10-11 17:02:43,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 386 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:43,725 INFO L231 Difference]: Finished difference. Result has 388 places, 386 transitions, 796 flow [2024-10-11 17:02:43,725 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=388, PETRI_TRANSITIONS=386} [2024-10-11 17:02:43,725 INFO L277 CegarLoopForPetriNet]: 410 programPoint places, -22 predicate places. [2024-10-11 17:02:43,726 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 386 transitions, 796 flow [2024-10-11 17:02:43,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:43,726 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:43,726 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:43,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:02:43,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2024-10-11 17:02:43,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash -963294461, now seen corresponding path program 1 times [2024-10-11 17:02:43,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:43,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578428496] [2024-10-11 17:02:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:43,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:43,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:43,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578428496] [2024-10-11 17:02:43,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578428496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:43,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:43,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058644985] [2024-10-11 17:02:43,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:43,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:43,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:43,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:43,785 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 424 [2024-10-11 17:02:43,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 386 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:43,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:43,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 424 [2024-10-11 17:02:43,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:47,384 INFO L124 PetriNetUnfolderBase]: 4251/26681 cut-off events. [2024-10-11 17:02:47,384 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2024-10-11 17:02:47,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32654 conditions, 26681 events. 4251/26681 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 358593 event pairs, 3630 based on Foata normal form. 0/22524 useless extension candidates. Maximal degree in co-relation 32610. Up to 5188 conditions per place. [2024-10-11 17:02:47,631 INFO L140 encePairwiseOnDemand]: 421/424 looper letters, 27 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2024-10-11 17:02:47,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 385 transitions, 852 flow [2024-10-11 17:02:47,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2024-10-11 17:02:47,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9056603773584906 [2024-10-11 17:02:47,634 INFO L175 Difference]: Start difference. First operand has 388 places, 386 transitions, 796 flow. Second operand 3 states and 1152 transitions. [2024-10-11 17:02:47,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 385 transitions, 852 flow [2024-10-11 17:02:47,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 385 transitions, 851 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:47,638 INFO L231 Difference]: Finished difference. Result has 388 places, 385 transitions, 797 flow [2024-10-11 17:02:47,638 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=388, PETRI_TRANSITIONS=385} [2024-10-11 17:02:47,639 INFO L277 CegarLoopForPetriNet]: 410 programPoint places, -22 predicate places. [2024-10-11 17:02:47,639 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 385 transitions, 797 flow [2024-10-11 17:02:47,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:47,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:47,639 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:47,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:02:47,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2024-10-11 17:02:47,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:47,640 INFO L85 PathProgramCache]: Analyzing trace with hash 417191485, now seen corresponding path program 1 times [2024-10-11 17:02:47,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:47,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241331843] [2024-10-11 17:02:47,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:47,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:02:47,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:47,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241331843] [2024-10-11 17:02:47,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241331843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:47,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:47,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:47,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112121113] [2024-10-11 17:02:47,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:47,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:47,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:47,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:47,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:47,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 424 [2024-10-11 17:02:47,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 385 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:47,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:47,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 424 [2024-10-11 17:02:47,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand