./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e281184c6e6629633efbcea3a2283a3a54dcfd040e15fa389b71c86937ccbf2b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:19:12,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:19:12,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:19:12,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:19:12,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:19:13,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:19:13,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:19:13,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:19:13,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:19:13,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:19:13,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:19:13,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:19:13,019 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:19:13,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:19:13,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:19:13,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:19:13,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:19:13,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:19:13,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:19:13,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:19:13,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:19:13,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:19:13,022 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:19:13,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:19:13,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:19:13,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:19:13,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:19:13,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:19:13,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:19:13,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:19:13,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:19:13,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:19:13,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:19:13,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:19:13,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:19:13,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:19:13,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:19:13,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:19:13,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:19:13,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:19:13,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:19:13,028 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e281184c6e6629633efbcea3a2283a3a54dcfd040e15fa389b71c86937ccbf2b [2024-10-14 17:19:13,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:19:13,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:19:13,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:19:13,262 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:19:13,263 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:19:13,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i [2024-10-14 17:19:14,542 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:19:14,776 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:19:14,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i [2024-10-14 17:19:14,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ea3e9e7/324d660845ff4dec832b132e7d20b2d7/FLAG2123587ee [2024-10-14 17:19:14,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ea3e9e7/324d660845ff4dec832b132e7d20b2d7 [2024-10-14 17:19:14,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:19:14,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:19:14,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:19:14,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:19:14,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:19:14,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:19:14" (1/1) ... [2024-10-14 17:19:14,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543facad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:14, skipping insertion in model container [2024-10-14 17:19:14,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:19:14" (1/1) ... [2024-10-14 17:19:14,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:19:15,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:19:15,291 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:19:15,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:19:15,406 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:19:15,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15 WrapperNode [2024-10-14 17:19:15,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:19:15,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:19:15,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:19:15,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:19:15,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15" (1/1) ... [2024-10-14 17:19:15,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15" (1/1) ... [2024-10-14 17:19:15,471 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-10-14 17:19:15,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:19:15,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:19:15,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:19:15,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:19:15,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15" (1/1) ... [2024-10-14 17:19:15,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15" (1/1) ... [2024-10-14 17:19:15,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15" (1/1) ... [2024-10-14 17:19:15,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15" (1/1) ... [2024-10-14 17:19:15,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15" (1/1) ... [2024-10-14 17:19:15,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15" (1/1) ... [2024-10-14 17:19:15,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15" (1/1) ... [2024-10-14 17:19:15,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15" (1/1) ... [2024-10-14 17:19:15,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:19:15,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:19:15,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:19:15,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:19:15,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15" (1/1) ... [2024-10-14 17:19:15,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:19:15,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:19:15,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:19:15,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:19:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:19:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-14 17:19:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:19:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:19:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-14 17:19:15,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:19:15,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:19:15,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:19:15,597 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-14 17:19:15,597 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-14 17:19:15,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:19:15,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:19:15,599 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:19:15,705 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:19:15,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:19:15,844 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:19:15,844 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:19:15,865 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:19:15,866 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 17:19:15,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:19:15 BoogieIcfgContainer [2024-10-14 17:19:15,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:19:15,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:19:15,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:19:15,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:19:15,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:19:14" (1/3) ... [2024-10-14 17:19:15,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f91001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:19:15, skipping insertion in model container [2024-10-14 17:19:15,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:19:15" (2/3) ... [2024-10-14 17:19:15,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f91001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:19:15, skipping insertion in model container [2024-10-14 17:19:15,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:19:15" (3/3) ... [2024-10-14 17:19:15,875 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic.i [2024-10-14 17:19:15,891 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:19:15,892 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 17:19:15,892 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:19:15,930 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-14 17:19:15,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 91 transitions, 189 flow [2024-10-14 17:19:16,016 INFO L124 PetriNetUnfolderBase]: 6/125 cut-off events. [2024-10-14 17:19:16,016 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 17:19:16,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 125 events. 6/125 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 62. Up to 4 conditions per place. [2024-10-14 17:19:16,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 91 transitions, 189 flow [2024-10-14 17:19:16,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 91 transitions, 189 flow [2024-10-14 17:19:16,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:19:16,037 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;@2e2e3ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:19:16,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 17:19:16,046 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:19:16,046 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-14 17:19:16,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:19:16,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:16,048 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] [2024-10-14 17:19:16,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-14 17:19:16,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash 637167217, now seen corresponding path program 1 times [2024-10-14 17:19:16,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:16,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796006899] [2024-10-14 17:19:16,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:16,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:16,285 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-14 17:19:16,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:16,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796006899] [2024-10-14 17:19:16,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796006899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:16,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:16,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:19:16,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912531344] [2024-10-14 17:19:16,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:16,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:16,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:16,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:16,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:16,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 91 [2024-10-14 17:19:16,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-14 17:19:16,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:16,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 91 [2024-10-14 17:19:16,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:16,408 INFO L124 PetriNetUnfolderBase]: 8/163 cut-off events. [2024-10-14 17:19:16,409 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2024-10-14 17:19:16,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 163 events. 8/163 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 414 event pairs, 1 based on Foata normal form. 8/154 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2024-10-14 17:19:16,411 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 8 selfloop transitions, 3 changer transitions 2/92 dead transitions. [2024-10-14 17:19:16,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 215 flow [2024-10-14 17:19:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:19:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:19:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2024-10-14 17:19:16,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9377289377289377 [2024-10-14 17:19:16,428 INFO L175 Difference]: Start difference. First operand has 90 places, 91 transitions, 189 flow. Second operand 3 states and 256 transitions. [2024-10-14 17:19:16,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 215 flow [2024-10-14 17:19:16,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:19:16,437 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 203 flow [2024-10-14 17:19:16,441 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-10-14 17:19:16,446 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2024-10-14 17:19:16,447 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 203 flow [2024-10-14 17:19:16,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-14 17:19:16,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:16,448 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-14 17:19:16,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:19:16,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-14 17:19:16,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1740217746, now seen corresponding path program 1 times [2024-10-14 17:19:16,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:16,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133416250] [2024-10-14 17:19:16,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:16,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:17,006 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-14 17:19:17,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133416250] [2024-10-14 17:19:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133416250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:17,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:17,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:19:17,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814457097] [2024-10-14 17:19:17,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:17,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:19:17,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:17,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:19:17,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:19:17,130 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 91 [2024-10-14 17:19:17,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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-14 17:19:17,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:17,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 91 [2024-10-14 17:19:17,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:17,223 INFO L124 PetriNetUnfolderBase]: 31/245 cut-off events. [2024-10-14 17:19:17,223 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-14 17:19:17,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 245 events. 31/245 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1068 event pairs, 11 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 277. Up to 62 conditions per place. [2024-10-14 17:19:17,225 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 24 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2024-10-14 17:19:17,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 275 flow [2024-10-14 17:19:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:19:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:19:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 426 transitions. [2024-10-14 17:19:17,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7802197802197802 [2024-10-14 17:19:17,228 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 203 flow. Second operand 6 states and 426 transitions. [2024-10-14 17:19:17,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 275 flow [2024-10-14 17:19:17,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:19:17,230 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 205 flow [2024-10-14 17:19:17,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-10-14 17:19:17,231 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2024-10-14 17:19:17,231 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 205 flow [2024-10-14 17:19:17,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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-14 17:19:17,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:17,232 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-14 17:19:17,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:19:17,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-14 17:19:17,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:17,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2045412567, now seen corresponding path program 1 times [2024-10-14 17:19:17,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:17,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609983409] [2024-10-14 17:19:17,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:17,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:17,300 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-14 17:19:17,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:17,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609983409] [2024-10-14 17:19:17,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609983409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:17,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:17,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:19:17,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821507051] [2024-10-14 17:19:17,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:17,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:19:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:17,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:19:17,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:19:17,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2024-10-14 17:19:17,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 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-14 17:19:17,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:17,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2024-10-14 17:19:17,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:17,419 INFO L124 PetriNetUnfolderBase]: 17/232 cut-off events. [2024-10-14 17:19:17,419 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:19:17,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 232 events. 17/232 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 805 event pairs, 1 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 227. Up to 49 conditions per place. [2024-10-14 17:19:17,422 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 15 selfloop transitions, 2 changer transitions 5/95 dead transitions. [2024-10-14 17:19:17,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 263 flow [2024-10-14 17:19:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:19:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:19:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 461 transitions. [2024-10-14 17:19:17,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8443223443223443 [2024-10-14 17:19:17,425 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 205 flow. Second operand 6 states and 461 transitions. [2024-10-14 17:19:17,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 263 flow [2024-10-14 17:19:17,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 253 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:19:17,428 INFO L231 Difference]: Finished difference. Result has 99 places, 88 transitions, 213 flow [2024-10-14 17:19:17,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=88} [2024-10-14 17:19:17,430 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2024-10-14 17:19:17,430 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 88 transitions, 213 flow [2024-10-14 17:19:17,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 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-14 17:19:17,431 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:17,431 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] [2024-10-14 17:19:17,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:19:17,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-14 17:19:17,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash 79107010, now seen corresponding path program 1 times [2024-10-14 17:19:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:17,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467425281] [2024-10-14 17:19:17,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:17,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:17,471 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-14 17:19:17,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:17,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467425281] [2024-10-14 17:19:17,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467425281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:17,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:17,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:19:17,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126365985] [2024-10-14 17:19:17,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:17,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:17,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:17,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:17,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:17,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2024-10-14 17:19:17,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-14 17:19:17,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:17,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2024-10-14 17:19:17,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:17,510 INFO L124 PetriNetUnfolderBase]: 5/169 cut-off events. [2024-10-14 17:19:17,510 INFO L125 PetriNetUnfolderBase]: For 19/32 co-relation queries the response was YES. [2024-10-14 17:19:17,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 169 events. 5/169 cut-off events. For 19/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 475 event pairs, 3 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 189. Up to 25 conditions per place. [2024-10-14 17:19:17,511 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 8 selfloop transitions, 4 changer transitions 3/91 dead transitions. [2024-10-14 17:19:17,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 249 flow [2024-10-14 17:19:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:19:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:19:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2024-10-14 17:19:17,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084249084249084 [2024-10-14 17:19:17,513 INFO L175 Difference]: Start difference. First operand has 99 places, 88 transitions, 213 flow. Second operand 3 states and 248 transitions. [2024-10-14 17:19:17,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 249 flow [2024-10-14 17:19:17,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 235 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-14 17:19:17,522 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 221 flow [2024-10-14 17:19:17,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-10-14 17:19:17,523 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2024-10-14 17:19:17,523 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 221 flow [2024-10-14 17:19:17,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-14 17:19:17,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:17,524 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] [2024-10-14 17:19:17,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:19:17,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-14 17:19:17,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:17,524 INFO L85 PathProgramCache]: Analyzing trace with hash 42510031, now seen corresponding path program 1 times [2024-10-14 17:19:17,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:17,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742623269] [2024-10-14 17:19:17,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:17,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:19:17,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:17,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742623269] [2024-10-14 17:19:17,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742623269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:17,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:17,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:19:17,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197395932] [2024-10-14 17:19:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:17,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:19:17,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:19:17,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:19:17,926 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 91 [2024-10-14 17:19:17,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 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-14 17:19:17,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:17,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 91 [2024-10-14 17:19:17,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:17,995 INFO L124 PetriNetUnfolderBase]: 25/282 cut-off events. [2024-10-14 17:19:17,995 INFO L125 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2024-10-14 17:19:17,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 282 events. 25/282 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1231 event pairs, 15 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 370. Up to 55 conditions per place. [2024-10-14 17:19:17,998 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 12 selfloop transitions, 0 changer transitions 20/95 dead transitions. [2024-10-14 17:19:17,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 289 flow [2024-10-14 17:19:17,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:19:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:19:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 436 transitions. [2024-10-14 17:19:18,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985347985347986 [2024-10-14 17:19:18,001 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 221 flow. Second operand 6 states and 436 transitions. [2024-10-14 17:19:18,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 289 flow [2024-10-14 17:19:18,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:19:18,006 INFO L231 Difference]: Finished difference. Result has 97 places, 75 transitions, 184 flow [2024-10-14 17:19:18,007 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2024-10-14 17:19:18,008 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2024-10-14 17:19:18,009 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 184 flow [2024-10-14 17:19:18,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 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-14 17:19:18,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:18,010 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:18,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:19:18,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-14 17:19:18,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:18,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2106051217, now seen corresponding path program 1 times [2024-10-14 17:19:18,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:18,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114992902] [2024-10-14 17:19:18,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:18,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:19:18,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 17:19:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:19:18,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 17:19:18,060 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 17:19:18,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-14 17:19:18,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-10-14 17:19:18,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-10-14 17:19:18,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-10-14 17:19:18,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-10-14 17:19:18,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-10-14 17:19:18,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:19:18,064 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 17:19:18,066 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 17:19:18,066 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-14 17:19:18,080 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 17:19:18,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 109 transitions, 234 flow [2024-10-14 17:19:18,103 INFO L124 PetriNetUnfolderBase]: 11/212 cut-off events. [2024-10-14 17:19:18,105 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:19:18,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 212 events. 11/212 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 446 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2024-10-14 17:19:18,106 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 109 transitions, 234 flow [2024-10-14 17:19:18,108 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 109 transitions, 234 flow [2024-10-14 17:19:18,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:19:18,109 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;@2e2e3ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:19:18,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 17:19:18,117 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:19:18,117 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-14 17:19:18,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:19:18,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:18,118 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] [2024-10-14 17:19:18,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-14 17:19:18,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1540354543, now seen corresponding path program 1 times [2024-10-14 17:19:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:18,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515197181] [2024-10-14 17:19:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:18,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:18,138 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-14 17:19:18,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515197181] [2024-10-14 17:19:18,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515197181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:18,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:18,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:19:18,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861843270] [2024-10-14 17:19:18,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:18,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:18,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:18,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 109 [2024-10-14 17:19:18,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-14 17:19:18,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:18,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 109 [2024-10-14 17:19:18,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:18,243 INFO L124 PetriNetUnfolderBase]: 119/731 cut-off events. [2024-10-14 17:19:18,244 INFO L125 PetriNetUnfolderBase]: For 44/68 co-relation queries the response was YES. [2024-10-14 17:19:18,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 731 events. 119/731 cut-off events. For 44/68 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4271 event pairs, 50 based on Foata normal form. 36/682 useless extension candidates. Maximal degree in co-relation 749. Up to 139 conditions per place. [2024-10-14 17:19:18,249 INFO L140 encePairwiseOnDemand]: 101/109 looper letters, 16 selfloop transitions, 4 changer transitions 1/113 dead transitions. [2024-10-14 17:19:18,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 113 transitions, 282 flow [2024-10-14 17:19:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:19:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:19:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2024-10-14 17:19:18,251 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.926605504587156 [2024-10-14 17:19:18,251 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 234 flow. Second operand 3 states and 303 transitions. [2024-10-14 17:19:18,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 113 transitions, 282 flow [2024-10-14 17:19:18,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:19:18,253 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 256 flow [2024-10-14 17:19:18,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2024-10-14 17:19:18,255 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places. [2024-10-14 17:19:18,255 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 256 flow [2024-10-14 17:19:18,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-14 17:19:18,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:18,256 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-14 17:19:18,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:19:18,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-14 17:19:18,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:18,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1300220009, now seen corresponding path program 1 times [2024-10-14 17:19:18,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:18,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184916965] [2024-10-14 17:19:18,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:18,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:18,301 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-14 17:19:18,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:18,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184916965] [2024-10-14 17:19:18,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184916965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:18,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:18,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:19:18,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144359743] [2024-10-14 17:19:18,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:18,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:19:18,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:18,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:19:18,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:19:18,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 109 [2024-10-14 17:19:18,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 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-14 17:19:18,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:18,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 109 [2024-10-14 17:19:18,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:18,509 INFO L124 PetriNetUnfolderBase]: 189/1195 cut-off events. [2024-10-14 17:19:18,509 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-10-14 17:19:18,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 1195 events. 189/1195 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8575 event pairs, 131 based on Foata normal form. 1/1096 useless extension candidates. Maximal degree in co-relation 1094. Up to 314 conditions per place. [2024-10-14 17:19:18,518 INFO L140 encePairwiseOnDemand]: 101/109 looper letters, 20 selfloop transitions, 2 changer transitions 5/116 dead transitions. [2024-10-14 17:19:18,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 116 transitions, 326 flow [2024-10-14 17:19:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:19:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:19:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2024-10-14 17:19:18,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8409785932721713 [2024-10-14 17:19:18,520 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 256 flow. Second operand 6 states and 550 transitions. [2024-10-14 17:19:18,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 116 transitions, 326 flow [2024-10-14 17:19:18,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:19:18,525 INFO L231 Difference]: Finished difference. Result has 119 places, 109 transitions, 270 flow [2024-10-14 17:19:18,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=119, PETRI_TRANSITIONS=109} [2024-10-14 17:19:18,526 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2024-10-14 17:19:18,527 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 109 transitions, 270 flow [2024-10-14 17:19:18,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 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-14 17:19:18,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:18,527 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-14 17:19:18,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:19:18,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-14 17:19:18,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1605414830, now seen corresponding path program 1 times [2024-10-14 17:19:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562711546] [2024-10-14 17:19:18,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:18,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:18,712 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-14 17:19:18,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562711546] [2024-10-14 17:19:18,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562711546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:18,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:18,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:19:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401491197] [2024-10-14 17:19:18,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:18,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:19:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:18,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:19:18,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:19:18,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 109 [2024-10-14 17:19:18,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 109 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 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-14 17:19:18,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:18,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 109 [2024-10-14 17:19:18,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:18,985 INFO L124 PetriNetUnfolderBase]: 298/1282 cut-off events. [2024-10-14 17:19:18,985 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-10-14 17:19:18,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2084 conditions, 1282 events. 298/1282 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9634 event pairs, 130 based on Foata normal form. 0/1183 useless extension candidates. Maximal degree in co-relation 959. Up to 371 conditions per place. [2024-10-14 17:19:18,993 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 37 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2024-10-14 17:19:18,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 124 transitions, 384 flow [2024-10-14 17:19:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:19:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:19:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2024-10-14 17:19:18,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7981651376146789 [2024-10-14 17:19:18,996 INFO L175 Difference]: Start difference. First operand has 119 places, 109 transitions, 270 flow. Second operand 6 states and 522 transitions. [2024-10-14 17:19:18,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 124 transitions, 384 flow [2024-10-14 17:19:18,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 124 transitions, 372 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 17:19:18,999 INFO L231 Difference]: Finished difference. Result has 116 places, 108 transitions, 266 flow [2024-10-14 17:19:18,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=116, PETRI_TRANSITIONS=108} [2024-10-14 17:19:19,001 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 7 predicate places. [2024-10-14 17:19:19,002 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 108 transitions, 266 flow [2024-10-14 17:19:19,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 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-14 17:19:19,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:19,002 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] [2024-10-14 17:19:19,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:19:19,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-14 17:19:19,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash -55830766, now seen corresponding path program 1 times [2024-10-14 17:19:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143574749] [2024-10-14 17:19:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:19,032 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-14 17:19:19,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:19,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143574749] [2024-10-14 17:19:19,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143574749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:19,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:19,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:19:19,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426997686] [2024-10-14 17:19:19,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:19,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:19,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:19,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:19,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:19,047 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 109 [2024-10-14 17:19:19,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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-14 17:19:19,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:19,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 109 [2024-10-14 17:19:19,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:19,144 INFO L124 PetriNetUnfolderBase]: 170/1036 cut-off events. [2024-10-14 17:19:19,144 INFO L125 PetriNetUnfolderBase]: For 196/323 co-relation queries the response was YES. [2024-10-14 17:19:19,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 1036 events. 170/1036 cut-off events. For 196/323 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7374 event pairs, 74 based on Foata normal form. 4/903 useless extension candidates. Maximal degree in co-relation 670. Up to 268 conditions per place. [2024-10-14 17:19:19,151 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 19 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2024-10-14 17:19:19,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 117 transitions, 350 flow [2024-10-14 17:19:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:19:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:19:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2024-10-14 17:19:19,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.908256880733945 [2024-10-14 17:19:19,153 INFO L175 Difference]: Start difference. First operand has 116 places, 108 transitions, 266 flow. Second operand 3 states and 297 transitions. [2024-10-14 17:19:19,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 117 transitions, 350 flow [2024-10-14 17:19:19,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 340 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:19:19,155 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 312 flow [2024-10-14 17:19:19,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2024-10-14 17:19:19,156 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 6 predicate places. [2024-10-14 17:19:19,156 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 312 flow [2024-10-14 17:19:19,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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-14 17:19:19,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:19,157 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] [2024-10-14 17:19:19,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:19:19,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-14 17:19:19,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:19,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2098394380, now seen corresponding path program 1 times [2024-10-14 17:19:19,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:19,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073077543] [2024-10-14 17:19:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:19,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:19:19,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:19,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073077543] [2024-10-14 17:19:19,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073077543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:19,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:19,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:19:19,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110678099] [2024-10-14 17:19:19,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:19,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:19:19,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:19,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:19:19,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:19:19,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 109 [2024-10-14 17:19:19,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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-14 17:19:19,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:19,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 109 [2024-10-14 17:19:19,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:19,634 INFO L124 PetriNetUnfolderBase]: 358/1837 cut-off events. [2024-10-14 17:19:19,634 INFO L125 PetriNetUnfolderBase]: For 312/360 co-relation queries the response was YES. [2024-10-14 17:19:19,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 1837 events. 358/1837 cut-off events. For 312/360 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 15485 event pairs, 179 based on Foata normal form. 4/1681 useless extension candidates. Maximal degree in co-relation 2430. Up to 362 conditions per place. [2024-10-14 17:19:19,643 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 34 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2024-10-14 17:19:19,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 128 transitions, 420 flow [2024-10-14 17:19:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:19:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:19:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions. [2024-10-14 17:19:19,645 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8134556574923547 [2024-10-14 17:19:19,646 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 312 flow. Second operand 6 states and 532 transitions. [2024-10-14 17:19:19,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 128 transitions, 420 flow [2024-10-14 17:19:19,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 128 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:19:19,649 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 306 flow [2024-10-14 17:19:19,650 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2024-10-14 17:19:19,650 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2024-10-14 17:19:19,650 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 306 flow [2024-10-14 17:19:19,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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-14 17:19:19,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:19,651 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:19,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:19:19,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-14 17:19:19,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash -605015293, now seen corresponding path program 1 times [2024-10-14 17:19:19,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:19,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100605749] [2024-10-14 17:19:19,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:19,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:19,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100605749] [2024-10-14 17:19:19,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100605749] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:19:19,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693751370] [2024-10-14 17:19:19,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:19,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:19:19,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:19:19,716 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:19:19,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:19:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:19,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:19:19,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:19:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:19,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:19:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:19,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693751370] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:19:19,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:19:19,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-14 17:19:19,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233344414] [2024-10-14 17:19:19,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:19:19,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:19:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:19,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:19:19,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:19:20,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 109 [2024-10-14 17:19:20,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 306 flow. Second operand has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 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-14 17:19:20,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:20,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 109 [2024-10-14 17:19:20,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:20,239 INFO L124 PetriNetUnfolderBase]: 159/1005 cut-off events. [2024-10-14 17:19:20,239 INFO L125 PetriNetUnfolderBase]: For 133/156 co-relation queries the response was YES. [2024-10-14 17:19:20,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1632 conditions, 1005 events. 159/1005 cut-off events. For 133/156 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6713 event pairs, 37 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 950. Up to 159 conditions per place. [2024-10-14 17:19:20,244 INFO L140 encePairwiseOnDemand]: 99/109 looper letters, 27 selfloop transitions, 9 changer transitions 9/134 dead transitions. [2024-10-14 17:19:20,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 134 transitions, 444 flow [2024-10-14 17:19:20,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:19:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 17:19:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 726 transitions. [2024-10-14 17:19:20,246 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8325688073394495 [2024-10-14 17:19:20,247 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 306 flow. Second operand 8 states and 726 transitions. [2024-10-14 17:19:20,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 134 transitions, 444 flow [2024-10-14 17:19:20,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 134 transitions, 432 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:19:20,249 INFO L231 Difference]: Finished difference. Result has 122 places, 113 transitions, 329 flow [2024-10-14 17:19:20,250 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=329, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2024-10-14 17:19:20,251 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 13 predicate places. [2024-10-14 17:19:20,251 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 329 flow [2024-10-14 17:19:20,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 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-14 17:19:20,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:20,252 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:20,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 17:19:20,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 17:19:20,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-14 17:19:20,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:20,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1309900068, now seen corresponding path program 1 times [2024-10-14 17:19:20,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:20,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462499118] [2024-10-14 17:19:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 17:19:20,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:20,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462499118] [2024-10-14 17:19:20,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462499118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:20,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:20,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:19:20,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513014599] [2024-10-14 17:19:20,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:20,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:20,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:20,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:20,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 109 [2024-10-14 17:19:20,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-14 17:19:20,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:20,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 109 [2024-10-14 17:19:20,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:20,575 INFO L124 PetriNetUnfolderBase]: 56/628 cut-off events. [2024-10-14 17:19:20,576 INFO L125 PetriNetUnfolderBase]: For 230/295 co-relation queries the response was YES. [2024-10-14 17:19:20,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 628 events. 56/628 cut-off events. For 230/295 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3800 event pairs, 30 based on Foata normal form. 3/608 useless extension candidates. Maximal degree in co-relation 935. Up to 119 conditions per place. [2024-10-14 17:19:20,579 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 19 selfloop transitions, 7 changer transitions 1/120 dead transitions. [2024-10-14 17:19:20,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 406 flow [2024-10-14 17:19:20,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:19:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:19:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2024-10-14 17:19:20,581 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9051987767584098 [2024-10-14 17:19:20,581 INFO L175 Difference]: Start difference. First operand has 122 places, 113 transitions, 329 flow. Second operand 3 states and 296 transitions. [2024-10-14 17:19:20,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 406 flow [2024-10-14 17:19:20,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 120 transitions, 400 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 17:19:20,583 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 373 flow [2024-10-14 17:19:20,583 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=373, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2024-10-14 17:19:20,584 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 14 predicate places. [2024-10-14 17:19:20,584 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 373 flow [2024-10-14 17:19:20,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-14 17:19:20,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:20,584 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:20,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:19:20,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-14 17:19:20,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:20,585 INFO L85 PathProgramCache]: Analyzing trace with hash -354026671, now seen corresponding path program 1 times [2024-10-14 17:19:20,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:20,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370686109] [2024-10-14 17:19:20,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:20,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:19:20,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 17:19:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:19:20,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 17:19:20,622 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 17:19:20,622 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-14 17:19:20,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-10-14 17:19:20,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-10-14 17:19:20,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-10-14 17:19:20,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-10-14 17:19:20,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-10-14 17:19:20,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-10-14 17:19:20,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:19:20,624 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:20,624 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 17:19:20,624 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-14 17:19:20,644 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 17:19:20,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 127 transitions, 281 flow [2024-10-14 17:19:20,667 INFO L124 PetriNetUnfolderBase]: 21/350 cut-off events. [2024-10-14 17:19:20,668 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-14 17:19:20,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 350 events. 21/350 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 958 event pairs, 1 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 220. Up to 16 conditions per place. [2024-10-14 17:19:20,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 127 transitions, 281 flow [2024-10-14 17:19:20,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 127 transitions, 281 flow [2024-10-14 17:19:20,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:19:20,672 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;@2e2e3ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:19:20,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 17:19:20,675 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:19:20,675 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-14 17:19:20,675 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:19:20,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:20,675 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] [2024-10-14 17:19:20,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-14 17:19:20,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash -964600847, now seen corresponding path program 1 times [2024-10-14 17:19:20,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:20,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583181407] [2024-10-14 17:19:20,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:20,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:20,693 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-14 17:19:20,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:20,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583181407] [2024-10-14 17:19:20,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583181407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:20,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:20,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:19:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605982773] [2024-10-14 17:19:20,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:20,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:20,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:20,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:20,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:20,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 127 [2024-10-14 17:19:20,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-14 17:19:20,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:20,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 127 [2024-10-14 17:19:20,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:21,042 INFO L124 PetriNetUnfolderBase]: 1071/4022 cut-off events. [2024-10-14 17:19:21,043 INFO L125 PetriNetUnfolderBase]: For 442/547 co-relation queries the response was YES. [2024-10-14 17:19:21,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5937 conditions, 4022 events. 1071/4022 cut-off events. For 442/547 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 36243 event pairs, 542 based on Foata normal form. 180/3761 useless extension candidates. Maximal degree in co-relation 4652. Up to 1110 conditions per place. [2024-10-14 17:19:21,069 INFO L140 encePairwiseOnDemand]: 118/127 looper letters, 23 selfloop transitions, 5 changer transitions 1/134 dead transitions. [2024-10-14 17:19:21,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 134 transitions, 351 flow [2024-10-14 17:19:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:19:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:19:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2024-10-14 17:19:21,070 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9186351706036745 [2024-10-14 17:19:21,070 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 281 flow. Second operand 3 states and 350 transitions. [2024-10-14 17:19:21,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 134 transitions, 351 flow [2024-10-14 17:19:21,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 134 transitions, 351 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:19:21,072 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 311 flow [2024-10-14 17:19:21,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2024-10-14 17:19:21,073 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 4 predicate places. [2024-10-14 17:19:21,073 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 311 flow [2024-10-14 17:19:21,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-14 17:19:21,073 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:21,073 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-14 17:19:21,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:19:21,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-14 17:19:21,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:21,074 INFO L85 PathProgramCache]: Analyzing trace with hash 853939566, now seen corresponding path program 1 times [2024-10-14 17:19:21,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:21,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739923232] [2024-10-14 17:19:21,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:21,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:21,251 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-14 17:19:21,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:21,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739923232] [2024-10-14 17:19:21,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739923232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:21,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:21,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:19:21,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276344950] [2024-10-14 17:19:21,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:21,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:19:21,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:21,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:19:21,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:19:21,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 127 [2024-10-14 17:19:21,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 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-14 17:19:21,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:21,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 127 [2024-10-14 17:19:21,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:21,965 INFO L124 PetriNetUnfolderBase]: 1992/6696 cut-off events. [2024-10-14 17:19:21,966 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2024-10-14 17:19:21,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10664 conditions, 6696 events. 1992/6696 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 66948 event pairs, 898 based on Foata normal form. 0/6018 useless extension candidates. Maximal degree in co-relation 6902. Up to 2168 conditions per place. [2024-10-14 17:19:22,004 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 48 selfloop transitions, 5 changer transitions 0/150 dead transitions. [2024-10-14 17:19:22,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 150 transitions, 463 flow [2024-10-14 17:19:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:19:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:19:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2024-10-14 17:19:22,006 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8110236220472441 [2024-10-14 17:19:22,006 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 311 flow. Second operand 6 states and 618 transitions. [2024-10-14 17:19:22,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 150 transitions, 463 flow [2024-10-14 17:19:22,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 150 transitions, 453 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:19:22,012 INFO L231 Difference]: Finished difference. Result has 133 places, 126 transitions, 309 flow [2024-10-14 17:19:22,012 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=133, PETRI_TRANSITIONS=126} [2024-10-14 17:19:22,013 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2024-10-14 17:19:22,013 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 126 transitions, 309 flow [2024-10-14 17:19:22,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 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-14 17:19:22,014 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:22,014 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-14 17:19:22,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:19:22,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-14 17:19:22,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash 548744745, now seen corresponding path program 1 times [2024-10-14 17:19:22,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:22,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274433375] [2024-10-14 17:19:22,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:22,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:22,064 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-14 17:19:22,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:22,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274433375] [2024-10-14 17:19:22,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274433375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:22,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:22,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:19:22,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480939807] [2024-10-14 17:19:22,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:22,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:19:22,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:22,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:19:22,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:19:22,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 127 [2024-10-14 17:19:22,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 126 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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-14 17:19:22,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:22,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 127 [2024-10-14 17:19:22,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:22,620 INFO L124 PetriNetUnfolderBase]: 1326/6241 cut-off events. [2024-10-14 17:19:22,621 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2024-10-14 17:19:22,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8873 conditions, 6241 events. 1326/6241 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 63418 event pairs, 760 based on Foata normal form. 1/5483 useless extension candidates. Maximal degree in co-relation 3021. Up to 1720 conditions per place. [2024-10-14 17:19:22,654 INFO L140 encePairwiseOnDemand]: 119/127 looper letters, 24 selfloop transitions, 2 changer transitions 5/134 dead transitions. [2024-10-14 17:19:22,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 387 flow [2024-10-14 17:19:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:19:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:19:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2024-10-14 17:19:22,657 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8372703412073491 [2024-10-14 17:19:22,657 INFO L175 Difference]: Start difference. First operand has 133 places, 126 transitions, 309 flow. Second operand 6 states and 638 transitions. [2024-10-14 17:19:22,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 387 flow [2024-10-14 17:19:22,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 134 transitions, 377 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:19:22,659 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 321 flow [2024-10-14 17:19:22,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2024-10-14 17:19:22,660 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2024-10-14 17:19:22,660 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 321 flow [2024-10-14 17:19:22,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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-14 17:19:22,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:22,661 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] [2024-10-14 17:19:22,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:19:22,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-14 17:19:22,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:22,661 INFO L85 PathProgramCache]: Analyzing trace with hash -76812734, now seen corresponding path program 1 times [2024-10-14 17:19:22,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:22,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450516593] [2024-10-14 17:19:22,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:22,680 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-14 17:19:22,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:22,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450516593] [2024-10-14 17:19:22,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450516593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:22,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:22,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:19:22,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034987532] [2024-10-14 17:19:22,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:22,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:22,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:22,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:22,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:22,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2024-10-14 17:19:22,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-14 17:19:22,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:22,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2024-10-14 17:19:22,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:23,303 INFO L124 PetriNetUnfolderBase]: 1740/6603 cut-off events. [2024-10-14 17:19:23,303 INFO L125 PetriNetUnfolderBase]: For 1609/2214 co-relation queries the response was YES. [2024-10-14 17:19:23,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11194 conditions, 6603 events. 1740/6603 cut-off events. For 1609/2214 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 68778 event pairs, 967 based on Foata normal form. 10/5862 useless extension candidates. Maximal degree in co-relation 11135. Up to 2240 conditions per place. [2024-10-14 17:19:23,347 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 29 selfloop transitions, 9 changer transitions 0/142 dead transitions. [2024-10-14 17:19:23,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 142 transitions, 455 flow [2024-10-14 17:19:23,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:19:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:19:23,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2024-10-14 17:19:23,349 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9081364829396326 [2024-10-14 17:19:23,349 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 321 flow. Second operand 3 states and 346 transitions. [2024-10-14 17:19:23,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 142 transitions, 455 flow [2024-10-14 17:19:23,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 142 transitions, 443 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 17:19:23,359 INFO L231 Difference]: Finished difference. Result has 134 places, 134 transitions, 385 flow [2024-10-14 17:19:23,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=134, PETRI_TRANSITIONS=134} [2024-10-14 17:19:23,360 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places. [2024-10-14 17:19:23,360 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 134 transitions, 385 flow [2024-10-14 17:19:23,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-14 17:19:23,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:23,360 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] [2024-10-14 17:19:23,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:19:23,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-14 17:19:23,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash -736876325, now seen corresponding path program 1 times [2024-10-14 17:19:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:23,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474286458] [2024-10-14 17:19:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:23,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:19:23,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:23,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474286458] [2024-10-14 17:19:23,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474286458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:23,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:23,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:19:23,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464031694] [2024-10-14 17:19:23,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:23,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:19:23,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:23,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:19:23,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:19:23,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 127 [2024-10-14 17:19:23,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 134 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-14 17:19:23,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:23,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 127 [2024-10-14 17:19:23,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:24,575 INFO L124 PetriNetUnfolderBase]: 2874/10393 cut-off events. [2024-10-14 17:19:24,576 INFO L125 PetriNetUnfolderBase]: For 1726/2295 co-relation queries the response was YES. [2024-10-14 17:19:24,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17543 conditions, 10393 events. 2874/10393 cut-off events. For 1726/2295 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 114908 event pairs, 1408 based on Foata normal form. 27/9250 useless extension candidates. Maximal degree in co-relation 13956. Up to 2157 conditions per place. [2024-10-14 17:19:24,631 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 46 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2024-10-14 17:19:24,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 157 transitions, 533 flow [2024-10-14 17:19:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:19:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:19:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2024-10-14 17:19:24,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8241469816272966 [2024-10-14 17:19:24,633 INFO L175 Difference]: Start difference. First operand has 134 places, 134 transitions, 385 flow. Second operand 6 states and 628 transitions. [2024-10-14 17:19:24,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 157 transitions, 533 flow [2024-10-14 17:19:24,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 157 transitions, 515 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:19:24,641 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 375 flow [2024-10-14 17:19:24,642 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2024-10-14 17:19:24,642 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 8 predicate places. [2024-10-14 17:19:24,642 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 375 flow [2024-10-14 17:19:24,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-14 17:19:24,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:24,643 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:24,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:19:24,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-14 17:19:24,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash -571759414, now seen corresponding path program 1 times [2024-10-14 17:19:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:24,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73500674] [2024-10-14 17:19:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:24,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:24,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73500674] [2024-10-14 17:19:24,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73500674] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:19:24,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811999856] [2024-10-14 17:19:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:24,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:19:24,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:19:24,699 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:19:24,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 17:19:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:24,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:19:24,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:19:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:24,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:19:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:24,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811999856] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:19:24,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:19:24,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-14 17:19:24,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123811160] [2024-10-14 17:19:24,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:19:24,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:19:24,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:24,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:19:24,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:19:25,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 127 [2024-10-14 17:19:25,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 375 flow. Second operand has 9 states, 9 states have (on average 101.22222222222223) internal successors, (911), 9 states have internal predecessors, (911), 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-14 17:19:25,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:25,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 127 [2024-10-14 17:19:25,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:25,742 INFO L124 PetriNetUnfolderBase]: 1466/6315 cut-off events. [2024-10-14 17:19:25,742 INFO L125 PetriNetUnfolderBase]: For 963/1188 co-relation queries the response was YES. [2024-10-14 17:19:25,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10653 conditions, 6315 events. 1466/6315 cut-off events. For 963/1188 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 64144 event pairs, 542 based on Foata normal form. 1/5719 useless extension candidates. Maximal degree in co-relation 5875. Up to 1078 conditions per place. [2024-10-14 17:19:25,764 INFO L140 encePairwiseOnDemand]: 117/127 looper letters, 48 selfloop transitions, 10 changer transitions 0/165 dead transitions. [2024-10-14 17:19:25,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 165 transitions, 566 flow [2024-10-14 17:19:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:19:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 17:19:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 851 transitions. [2024-10-14 17:19:25,766 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8375984251968503 [2024-10-14 17:19:25,766 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 375 flow. Second operand 8 states and 851 transitions. [2024-10-14 17:19:25,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 165 transitions, 566 flow [2024-10-14 17:19:25,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 165 transitions, 554 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:19:25,771 INFO L231 Difference]: Finished difference. Result has 141 places, 136 transitions, 409 flow [2024-10-14 17:19:25,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=409, PETRI_PLACES=141, PETRI_TRANSITIONS=136} [2024-10-14 17:19:25,771 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 13 predicate places. [2024-10-14 17:19:25,771 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 409 flow [2024-10-14 17:19:25,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 101.22222222222223) internal successors, (911), 9 states have internal predecessors, (911), 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-14 17:19:25,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:25,772 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:25,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:19:25,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-14 17:19:25,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-14 17:19:25,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash 909388675, now seen corresponding path program 1 times [2024-10-14 17:19:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:25,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635166165] [2024-10-14 17:19:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:25,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 17:19:25,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:25,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635166165] [2024-10-14 17:19:25,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635166165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:25,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:25,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:19:25,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446243465] [2024-10-14 17:19:25,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:25,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:25,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:25,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:25,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:26,012 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2024-10-14 17:19:26,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 136 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-14 17:19:26,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:26,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2024-10-14 17:19:26,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:26,436 INFO L124 PetriNetUnfolderBase]: 1088/4910 cut-off events. [2024-10-14 17:19:26,436 INFO L125 PetriNetUnfolderBase]: For 2557/2796 co-relation queries the response was YES. [2024-10-14 17:19:26,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9302 conditions, 4910 events. 1088/4910 cut-off events. For 2557/2796 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 51446 event pairs, 589 based on Foata normal form. 8/4547 useless extension candidates. Maximal degree in co-relation 8493. Up to 1450 conditions per place. [2024-10-14 17:19:26,460 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 31 selfloop transitions, 13 changer transitions 0/152 dead transitions. [2024-10-14 17:19:26,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 570 flow [2024-10-14 17:19:26,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:19:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:19:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2024-10-14 17:19:26,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.905511811023622 [2024-10-14 17:19:26,461 INFO L175 Difference]: Start difference. First operand has 141 places, 136 transitions, 409 flow. Second operand 3 states and 345 transitions. [2024-10-14 17:19:26,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 152 transitions, 570 flow [2024-10-14 17:19:26,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 152 transitions, 564 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 17:19:26,466 INFO L231 Difference]: Finished difference. Result has 142 places, 145 transitions, 521 flow [2024-10-14 17:19:26,466 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=142, PETRI_TRANSITIONS=145} [2024-10-14 17:19:26,466 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 14 predicate places. [2024-10-14 17:19:26,466 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 145 transitions, 521 flow [2024-10-14 17:19:26,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-14 17:19:26,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:26,467 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:26,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 17:19:26,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-14 17:19:26,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:26,467 INFO L85 PathProgramCache]: Analyzing trace with hash 744566551, now seen corresponding path program 1 times [2024-10-14 17:19:26,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:26,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230286217] [2024-10-14 17:19:26,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:26,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 17:19:26,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:26,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230286217] [2024-10-14 17:19:26,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230286217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:26,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:26,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:19:26,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304752018] [2024-10-14 17:19:26,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:26,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:26,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:26,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:26,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 127 [2024-10-14 17:19:26,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 145 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-14 17:19:26,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:26,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 127 [2024-10-14 17:19:26,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:26,641 INFO L124 PetriNetUnfolderBase]: 117/1565 cut-off events. [2024-10-14 17:19:26,641 INFO L125 PetriNetUnfolderBase]: For 716/758 co-relation queries the response was YES. [2024-10-14 17:19:26,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 1565 events. 117/1565 cut-off events. For 716/758 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 12762 event pairs, 43 based on Foata normal form. 21/1532 useless extension candidates. Maximal degree in co-relation 2169. Up to 144 conditions per place. [2024-10-14 17:19:26,646 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 12 selfloop transitions, 6 changer transitions 0/140 dead transitions. [2024-10-14 17:19:26,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 140 transitions, 494 flow [2024-10-14 17:19:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:19:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:19:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2024-10-14 17:19:26,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9291338582677166 [2024-10-14 17:19:26,647 INFO L175 Difference]: Start difference. First operand has 142 places, 145 transitions, 521 flow. Second operand 3 states and 354 transitions. [2024-10-14 17:19:26,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 140 transitions, 494 flow [2024-10-14 17:19:26,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 140 transitions, 480 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-14 17:19:26,651 INFO L231 Difference]: Finished difference. Result has 142 places, 135 transitions, 425 flow [2024-10-14 17:19:26,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=142, PETRI_TRANSITIONS=135} [2024-10-14 17:19:26,651 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 14 predicate places. [2024-10-14 17:19:26,651 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 135 transitions, 425 flow [2024-10-14 17:19:26,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-14 17:19:26,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:26,652 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:26,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 17:19:26,652 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-14 17:19:26,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:26,652 INFO L85 PathProgramCache]: Analyzing trace with hash -347694239, now seen corresponding path program 1 times [2024-10-14 17:19:26,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:26,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581753930] [2024-10-14 17:19:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-14 17:19:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:26,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581753930] [2024-10-14 17:19:26,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581753930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:26,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:26,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:19:26,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293466863] [2024-10-14 17:19:26,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:26,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:26,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:26,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:26,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:26,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2024-10-14 17:19:26,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 135 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-14 17:19:26,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:26,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2024-10-14 17:19:26,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:26,852 INFO L124 PetriNetUnfolderBase]: 203/1858 cut-off events. [2024-10-14 17:19:26,852 INFO L125 PetriNetUnfolderBase]: For 1356/1421 co-relation queries the response was YES. [2024-10-14 17:19:26,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3569 conditions, 1858 events. 203/1858 cut-off events. For 1356/1421 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 16383 event pairs, 134 based on Foata normal form. 3/1769 useless extension candidates. Maximal degree in co-relation 2979. Up to 435 conditions per place. [2024-10-14 17:19:26,858 INFO L140 encePairwiseOnDemand]: 122/127 looper letters, 25 selfloop transitions, 5 changer transitions 0/140 dead transitions. [2024-10-14 17:19:26,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 140 transitions, 507 flow [2024-10-14 17:19:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:19:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:19:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2024-10-14 17:19:26,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8871391076115486 [2024-10-14 17:19:26,859 INFO L175 Difference]: Start difference. First operand has 142 places, 135 transitions, 425 flow. Second operand 3 states and 338 transitions. [2024-10-14 17:19:26,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 140 transitions, 507 flow [2024-10-14 17:19:26,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 140 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:19:26,863 INFO L231 Difference]: Finished difference. Result has 145 places, 138 transitions, 459 flow [2024-10-14 17:19:26,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=145, PETRI_TRANSITIONS=138} [2024-10-14 17:19:26,863 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 17 predicate places. [2024-10-14 17:19:26,863 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 138 transitions, 459 flow [2024-10-14 17:19:26,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-14 17:19:26,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:26,864 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-10-14 17:19:26,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 17:19:26,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-14 17:19:26,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1089870802, now seen corresponding path program 1 times [2024-10-14 17:19:26,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:26,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744054590] [2024-10-14 17:19:26,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:26,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:19:26,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 17:19:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:19:26,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 17:19:26,903 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 17:19:26,903 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-10-14 17:19:26,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-10-14 17:19:26,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-10-14 17:19:26,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-10-14 17:19:26,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-10-14 17:19:26,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-10-14 17:19:26,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-10-14 17:19:26,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-10-14 17:19:26,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 17:19:26,904 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:26,906 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 17:19:26,906 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-14 17:19:26,927 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-14 17:19:26,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 145 transitions, 330 flow [2024-10-14 17:19:26,968 INFO L124 PetriNetUnfolderBase]: 43/592 cut-off events. [2024-10-14 17:19:26,969 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-14 17:19:26,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 592 events. 43/592 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2112 event pairs, 6 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 370. Up to 32 conditions per place. [2024-10-14 17:19:26,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 145 transitions, 330 flow [2024-10-14 17:19:26,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 145 transitions, 330 flow [2024-10-14 17:19:26,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:19:26,973 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;@2e2e3ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:19:26,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-14 17:19:26,975 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:19:26,975 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-14 17:19:26,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:19:26,976 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:26,976 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] [2024-10-14 17:19:26,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-14 17:19:26,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:26,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1930538991, now seen corresponding path program 1 times [2024-10-14 17:19:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:26,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880729740] [2024-10-14 17:19:26,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:26,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:26,995 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-14 17:19:26,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880729740] [2024-10-14 17:19:26,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880729740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:26,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:26,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:19:26,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133925728] [2024-10-14 17:19:26,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:26,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:26,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:26,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:26,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:27,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 145 [2024-10-14 17:19:27,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 145 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-14 17:19:27,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:27,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 145 [2024-10-14 17:19:27,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:29,452 INFO L124 PetriNetUnfolderBase]: 7859/23535 cut-off events. [2024-10-14 17:19:29,453 INFO L125 PetriNetUnfolderBase]: For 2517/2868 co-relation queries the response was YES. [2024-10-14 17:19:29,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35885 conditions, 23535 events. 7859/23535 cut-off events. For 2517/2868 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 271409 event pairs, 4292 based on Foata normal form. 871/22186 useless extension candidates. Maximal degree in co-relation 28583. Up to 7653 conditions per place. [2024-10-14 17:19:29,661 INFO L140 encePairwiseOnDemand]: 135/145 looper letters, 30 selfloop transitions, 6 changer transitions 1/155 dead transitions. [2024-10-14 17:19:29,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 155 transitions, 422 flow [2024-10-14 17:19:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:19:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:19:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2024-10-14 17:19:29,663 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9126436781609195 [2024-10-14 17:19:29,663 INFO L175 Difference]: Start difference. First operand has 147 places, 145 transitions, 330 flow. Second operand 3 states and 397 transitions. [2024-10-14 17:19:29,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 155 transitions, 422 flow [2024-10-14 17:19:29,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 155 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:19:29,667 INFO L231 Difference]: Finished difference. Result has 151 places, 146 transitions, 368 flow [2024-10-14 17:19:29,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=151, PETRI_TRANSITIONS=146} [2024-10-14 17:19:29,667 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 4 predicate places. [2024-10-14 17:19:29,667 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 146 transitions, 368 flow [2024-10-14 17:19:29,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-14 17:19:29,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:29,668 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-14 17:19:29,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 17:19:29,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-14 17:19:29,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash 300323758, now seen corresponding path program 1 times [2024-10-14 17:19:29,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:29,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737275230] [2024-10-14 17:19:29,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:29,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:29,829 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-14 17:19:29,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737275230] [2024-10-14 17:19:29,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737275230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:29,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:29,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:19:29,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488497197] [2024-10-14 17:19:29,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:29,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:19:29,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:29,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:19:29,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:19:29,921 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 145 [2024-10-14 17:19:29,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 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-14 17:19:29,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:29,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 145 [2024-10-14 17:19:29,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:33,458 INFO L124 PetriNetUnfolderBase]: 13638/36400 cut-off events. [2024-10-14 17:19:33,458 INFO L125 PetriNetUnfolderBase]: For 3211/3211 co-relation queries the response was YES. [2024-10-14 17:19:33,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60528 conditions, 36400 events. 13638/36400 cut-off events. For 3211/3211 co-relation queries the response was YES. Maximal size of possible extension queue 1438. Compared 435337 event pairs, 2826 based on Foata normal form. 0/31775 useless extension candidates. Maximal degree in co-relation 35745. Up to 13302 conditions per place. [2024-10-14 17:19:33,917 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 60 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2024-10-14 17:19:33,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 177 transitions, 560 flow [2024-10-14 17:19:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:19:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:19:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2024-10-14 17:19:33,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8206896551724138 [2024-10-14 17:19:33,919 INFO L175 Difference]: Start difference. First operand has 151 places, 146 transitions, 368 flow. Second operand 6 states and 714 transitions. [2024-10-14 17:19:33,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 177 transitions, 560 flow [2024-10-14 17:19:34,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 177 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:19:34,016 INFO L231 Difference]: Finished difference. Result has 152 places, 145 transitions, 364 flow [2024-10-14 17:19:34,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=152, PETRI_TRANSITIONS=145} [2024-10-14 17:19:34,016 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 5 predicate places. [2024-10-14 17:19:34,016 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 145 transitions, 364 flow [2024-10-14 17:19:34,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 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-14 17:19:34,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:34,017 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-14 17:19:34,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 17:19:34,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-14 17:19:34,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:34,017 INFO L85 PathProgramCache]: Analyzing trace with hash -4871063, now seen corresponding path program 1 times [2024-10-14 17:19:34,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:34,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883330970] [2024-10-14 17:19:34,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:34,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:34,056 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-14 17:19:34,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:34,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883330970] [2024-10-14 17:19:34,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883330970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:34,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:34,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:19:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310883850] [2024-10-14 17:19:34,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:34,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:19:34,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:34,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:19:34,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:19:34,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 145 [2024-10-14 17:19:34,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 145 transitions, 364 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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-14 17:19:34,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:34,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 145 [2024-10-14 17:19:34,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:37,683 INFO L124 PetriNetUnfolderBase]: 9343/33719 cut-off events. [2024-10-14 17:19:37,683 INFO L125 PetriNetUnfolderBase]: For 1637/1637 co-relation queries the response was YES. [2024-10-14 17:19:37,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49426 conditions, 33719 events. 9343/33719 cut-off events. For 1637/1637 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 429793 event pairs, 7523 based on Foata normal form. 1/29645 useless extension candidates. Maximal degree in co-relation 31640. Up to 10778 conditions per place. [2024-10-14 17:19:37,913 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 28 selfloop transitions, 2 changer transitions 5/153 dead transitions. [2024-10-14 17:19:37,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 153 transitions, 450 flow [2024-10-14 17:19:37,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:19:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:19:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2024-10-14 17:19:37,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8344827586206897 [2024-10-14 17:19:37,915 INFO L175 Difference]: Start difference. First operand has 152 places, 145 transitions, 364 flow. Second operand 6 states and 726 transitions. [2024-10-14 17:19:37,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 153 transitions, 450 flow [2024-10-14 17:19:37,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 153 transitions, 440 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:19:37,919 INFO L231 Difference]: Finished difference. Result has 156 places, 146 transitions, 376 flow [2024-10-14 17:19:37,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=156, PETRI_TRANSITIONS=146} [2024-10-14 17:19:37,920 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 9 predicate places. [2024-10-14 17:19:37,920 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 146 transitions, 376 flow [2024-10-14 17:19:37,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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-14 17:19:37,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:37,921 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] [2024-10-14 17:19:37,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 17:19:37,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-14 17:19:37,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:37,921 INFO L85 PathProgramCache]: Analyzing trace with hash 540197122, now seen corresponding path program 1 times [2024-10-14 17:19:37,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:37,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649813225] [2024-10-14 17:19:37,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:37,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:37,950 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-14 17:19:37,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:37,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649813225] [2024-10-14 17:19:37,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649813225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:37,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:37,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:19:37,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691934640] [2024-10-14 17:19:37,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:37,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:37,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:37,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:37,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:37,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2024-10-14 17:19:37,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 146 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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-14 17:19:37,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:37,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2024-10-14 17:19:37,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:42,584 INFO L124 PetriNetUnfolderBase]: 13629/41376 cut-off events. [2024-10-14 17:19:42,585 INFO L125 PetriNetUnfolderBase]: For 10673/13732 co-relation queries the response was YES. [2024-10-14 17:19:42,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72233 conditions, 41376 events. 13629/41376 cut-off events. For 10673/13732 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 530347 event pairs, 7860 based on Foata normal form. 36/36839 useless extension candidates. Maximal degree in co-relation 72173. Up to 15880 conditions per place. [2024-10-14 17:19:42,942 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 39 selfloop transitions, 11 changer transitions 0/167 dead transitions. [2024-10-14 17:19:42,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 167 transitions, 562 flow [2024-10-14 17:19:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:19:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:19:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2024-10-14 17:19:42,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2024-10-14 17:19:42,944 INFO L175 Difference]: Start difference. First operand has 156 places, 146 transitions, 376 flow. Second operand 3 states and 395 transitions. [2024-10-14 17:19:42,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 167 transitions, 562 flow [2024-10-14 17:19:43,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 167 transitions, 550 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 17:19:43,109 INFO L231 Difference]: Finished difference. Result has 153 places, 155 transitions, 460 flow [2024-10-14 17:19:43,109 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=153, PETRI_TRANSITIONS=155} [2024-10-14 17:19:43,109 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 6 predicate places. [2024-10-14 17:19:43,109 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 155 transitions, 460 flow [2024-10-14 17:19:43,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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-14 17:19:43,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:43,110 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] [2024-10-14 17:19:43,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 17:19:43,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-14 17:19:43,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:43,110 INFO L85 PathProgramCache]: Analyzing trace with hash 126632508, now seen corresponding path program 1 times [2024-10-14 17:19:43,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:43,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889081918] [2024-10-14 17:19:43,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:43,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:19:43,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:43,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889081918] [2024-10-14 17:19:43,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889081918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:43,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:43,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:19:43,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794724628] [2024-10-14 17:19:43,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:43,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:19:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:19:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:19:43,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 145 [2024-10-14 17:19:43,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 155 transitions, 460 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 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-14 17:19:43,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:43,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 145 [2024-10-14 17:19:43,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:48,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][152], [120#L1038-1true, 132#L1024true, 172#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 147#true, Black: 152#(= |#race~data~0| 0), 46#L1022-3true, 58#L1023-5true, 144#true, 142#true]) [2024-10-14 17:19:48,347 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-14 17:19:48,347 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-14 17:19:48,347 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-14 17:19:48,348 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-14 17:19:48,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][184], [120#L1038-1true, 24#L1023-5true, 172#true, 148#true, 100#L1023-6true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 142#true]) [2024-10-14 17:19:48,450 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-14 17:19:48,450 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:19:48,450 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:19:48,450 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:19:48,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][152], [120#L1038-1true, 114#L1023-5true, 172#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 147#true, 21#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 144#true, 142#true]) [2024-10-14 17:19:48,508 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-14 17:19:48,508 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-10-14 17:19:48,508 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-10-14 17:19:48,508 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:19:49,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][179], [120#L1038-1true, 24#L1023-5true, 132#L1024true, 172#true, 148#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 142#true]) [2024-10-14 17:19:49,083 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is not cut-off event [2024-10-14 17:19:49,083 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-14 17:19:49,083 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-14 17:19:49,084 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-14 17:19:49,540 INFO L124 PetriNetUnfolderBase]: 19999/58031 cut-off events. [2024-10-14 17:19:49,541 INFO L125 PetriNetUnfolderBase]: For 9661/13630 co-relation queries the response was YES. [2024-10-14 17:19:50,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100957 conditions, 58031 events. 19999/58031 cut-off events. For 9661/13630 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 761259 event pairs, 9797 based on Foata normal form. 80/50818 useless extension candidates. Maximal degree in co-relation 79535. Up to 12713 conditions per place. [2024-10-14 17:19:50,232 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 58 selfloop transitions, 5 changer transitions 0/186 dead transitions. [2024-10-14 17:19:50,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 186 transitions, 648 flow [2024-10-14 17:19:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:19:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:19:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2024-10-14 17:19:50,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.832183908045977 [2024-10-14 17:19:50,233 INFO L175 Difference]: Start difference. First operand has 153 places, 155 transitions, 460 flow. Second operand 6 states and 724 transitions. [2024-10-14 17:19:50,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 186 transitions, 648 flow [2024-10-14 17:19:50,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 186 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:19:50,316 INFO L231 Difference]: Finished difference. Result has 155 places, 154 transitions, 446 flow [2024-10-14 17:19:50,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=155, PETRI_TRANSITIONS=154} [2024-10-14 17:19:50,317 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 8 predicate places. [2024-10-14 17:19:50,317 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 446 flow [2024-10-14 17:19:50,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 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-14 17:19:50,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:50,317 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:50,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 17:19:50,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-14 17:19:50,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1581356987, now seen corresponding path program 1 times [2024-10-14 17:19:50,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:50,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173778164] [2024-10-14 17:19:50,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:50,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:50,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:50,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173778164] [2024-10-14 17:19:50,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173778164] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:19:50,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335747256] [2024-10-14 17:19:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:50,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:19:50,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:19:50,382 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:19:50,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 17:19:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:50,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:19:50,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:19:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:50,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:19:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:19:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335747256] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:19:50,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:19:50,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-14 17:19:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586139345] [2024-10-14 17:19:50,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:19:50,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:19:50,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:50,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:19:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:19:50,665 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 145 [2024-10-14 17:19:50,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 446 flow. Second operand has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 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-14 17:19:50,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:50,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 145 [2024-10-14 17:19:50,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:53,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][192], [120#L1038-1true, 24#L1023-5true, 100#L1023-6true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 148#true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 142#true]) [2024-10-14 17:19:53,643 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-14 17:19:53,644 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:19:53,644 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:19:53,644 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-14 17:19:54,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][190], [120#L1038-1true, 24#L1023-5true, 132#L1024true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 148#true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 142#true]) [2024-10-14 17:19:54,311 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is not cut-off event [2024-10-14 17:19:54,311 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-14 17:19:54,311 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-14 17:19:54,311 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-14 17:19:54,888 INFO L124 PetriNetUnfolderBase]: 11192/37624 cut-off events. [2024-10-14 17:19:54,889 INFO L125 PetriNetUnfolderBase]: For 6000/7803 co-relation queries the response was YES. [2024-10-14 17:19:55,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64698 conditions, 37624 events. 11192/37624 cut-off events. For 6000/7803 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 482348 event pairs, 3970 based on Foata normal form. 15/33084 useless extension candidates. Maximal degree in co-relation 32683. Up to 6542 conditions per place. [2024-10-14 17:19:55,143 INFO L140 encePairwiseOnDemand]: 135/145 looper letters, 61 selfloop transitions, 10 changer transitions 0/195 dead transitions. [2024-10-14 17:19:55,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 195 transitions, 684 flow [2024-10-14 17:19:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:19:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 17:19:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 976 transitions. [2024-10-14 17:19:55,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8413793103448276 [2024-10-14 17:19:55,145 INFO L175 Difference]: Start difference. First operand has 155 places, 154 transitions, 446 flow. Second operand 8 states and 976 transitions. [2024-10-14 17:19:55,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 195 transitions, 684 flow [2024-10-14 17:19:55,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 195 transitions, 672 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:19:55,168 INFO L231 Difference]: Finished difference. Result has 160 places, 157 transitions, 480 flow [2024-10-14 17:19:55,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=480, PETRI_PLACES=160, PETRI_TRANSITIONS=157} [2024-10-14 17:19:55,169 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 13 predicate places. [2024-10-14 17:19:55,169 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 157 transitions, 480 flow [2024-10-14 17:19:55,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 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-14 17:19:55,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:19:55,169 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:19:55,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 17:19:55,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:19:55,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-14 17:19:55,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:19:55,371 INFO L85 PathProgramCache]: Analyzing trace with hash -900737980, now seen corresponding path program 1 times [2024-10-14 17:19:55,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:19:55,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930639843] [2024-10-14 17:19:55,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:19:55,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:19:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:19:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 17:19:55,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:19:55,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930639843] [2024-10-14 17:19:55,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930639843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:19:55,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:19:55,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:19:55,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046776413] [2024-10-14 17:19:55,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:19:55,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:19:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:19:55,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:19:55,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:19:55,431 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2024-10-14 17:19:55,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 157 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-14 17:19:55,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:19:55,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2024-10-14 17:19:55,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:19:59,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([550] L1037-1-->L1038: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [Black: 185#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 188#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 145#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 100#L1023-6true, 71#L1038true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 34#L1024true, 147#true, Black: 150#true, 547#true, 144#true, 142#true]) [2024-10-14 17:19:59,678 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-10-14 17:19:59,678 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-14 17:19:59,678 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-14 17:19:59,678 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-14 17:19:59,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([550] L1037-1-->L1038: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [Black: 185#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 188#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 145#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 100#L1023-6true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 71#L1038true, 119#L1024-3true, Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 147#true, Black: 150#true, 547#true, 144#true, 142#true]) [2024-10-14 17:19:59,688 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2024-10-14 17:19:59,688 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-14 17:19:59,688 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-14 17:19:59,688 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-14 17:19:59,940 INFO L124 PetriNetUnfolderBase]: 11771/39207 cut-off events. [2024-10-14 17:19:59,940 INFO L125 PetriNetUnfolderBase]: For 22855/25072 co-relation queries the response was YES. [2024-10-14 17:20:00,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77047 conditions, 39207 events. 11771/39207 cut-off events. For 22855/25072 co-relation queries the response was YES. Maximal size of possible extension queue 1521. Compared 529642 event pairs, 6498 based on Foata normal form. 35/35580 useless extension candidates. Maximal degree in co-relation 69546. Up to 13618 conditions per place. [2024-10-14 17:20:00,213 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 43 selfloop transitions, 18 changer transitions 0/182 dead transitions. [2024-10-14 17:20:00,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 182 transitions, 725 flow [2024-10-14 17:20:00,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:20:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:20:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2024-10-14 17:20:00,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9057471264367816 [2024-10-14 17:20:00,214 INFO L175 Difference]: Start difference. First operand has 160 places, 157 transitions, 480 flow. Second operand 3 states and 394 transitions. [2024-10-14 17:20:00,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 182 transitions, 725 flow [2024-10-14 17:20:00,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 182 transitions, 719 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 17:20:00,245 INFO L231 Difference]: Finished difference. Result has 161 places, 171 transitions, 652 flow [2024-10-14 17:20:00,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=161, PETRI_TRANSITIONS=171} [2024-10-14 17:20:00,246 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places. [2024-10-14 17:20:00,246 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 171 transitions, 652 flow [2024-10-14 17:20:00,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-14 17:20:00,246 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:20:00,247 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:20:00,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 17:20:00,247 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-14 17:20:00,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:20:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1714902840, now seen corresponding path program 1 times [2024-10-14 17:20:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:20:00,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768713252] [2024-10-14 17:20:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:20:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:20:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:20:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 17:20:00,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:20:00,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768713252] [2024-10-14 17:20:00,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768713252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:20:00,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:20:00,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:20:00,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037946817] [2024-10-14 17:20:00,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:20:00,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:20:00,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:20:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:20:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:20:00,318 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 145 [2024-10-14 17:20:00,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 171 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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-14 17:20:00,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:20:00,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 145 [2024-10-14 17:20:00,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:20:00,889 INFO L124 PetriNetUnfolderBase]: 660/6386 cut-off events. [2024-10-14 17:20:00,889 INFO L125 PetriNetUnfolderBase]: For 3202/3390 co-relation queries the response was YES. [2024-10-14 17:20:00,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11149 conditions, 6386 events. 660/6386 cut-off events. For 3202/3390 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 73150 event pairs, 237 based on Foata normal form. 177/6223 useless extension candidates. Maximal degree in co-relation 8698. Up to 678 conditions per place. [2024-10-14 17:20:00,922 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 16 selfloop transitions, 8 changer transitions 0/161 dead transitions. [2024-10-14 17:20:00,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 161 transitions, 585 flow [2024-10-14 17:20:00,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:20:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:20:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2024-10-14 17:20:00,923 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9264367816091954 [2024-10-14 17:20:00,923 INFO L175 Difference]: Start difference. First operand has 161 places, 171 transitions, 652 flow. Second operand 3 states and 403 transitions. [2024-10-14 17:20:00,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 161 transitions, 585 flow [2024-10-14 17:20:00,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 161 transitions, 571 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-14 17:20:00,933 INFO L231 Difference]: Finished difference. Result has 161 places, 154 transitions, 492 flow [2024-10-14 17:20:00,934 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=161, PETRI_TRANSITIONS=154} [2024-10-14 17:20:00,934 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places. [2024-10-14 17:20:00,934 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 154 transitions, 492 flow [2024-10-14 17:20:00,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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-14 17:20:00,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:20:00,935 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:20:00,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 17:20:00,935 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-14 17:20:00,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:20:00,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2046835631, now seen corresponding path program 1 times [2024-10-14 17:20:00,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:20:00,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576092841] [2024-10-14 17:20:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:20:00,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:20:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:20:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-14 17:20:00,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:20:00,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576092841] [2024-10-14 17:20:00,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576092841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:20:00,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:20:00,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:20:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690206526] [2024-10-14 17:20:00,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:20:00,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:20:00,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:20:00,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:20:00,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:20:00,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2024-10-14 17:20:00,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 154 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-14 17:20:00,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:20:00,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2024-10-14 17:20:00,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:20:02,043 INFO L124 PetriNetUnfolderBase]: 1114/7737 cut-off events. [2024-10-14 17:20:02,043 INFO L125 PetriNetUnfolderBase]: For 6587/6748 co-relation queries the response was YES. [2024-10-14 17:20:02,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15370 conditions, 7737 events. 1114/7737 cut-off events. For 6587/6748 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 92194 event pairs, 714 based on Foata normal form. 7/7220 useless extension candidates. Maximal degree in co-relation 12078. Up to 2065 conditions per place. [2024-10-14 17:20:02,091 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 33 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2024-10-14 17:20:02,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 161 transitions, 606 flow [2024-10-14 17:20:02,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:20:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:20:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2024-10-14 17:20:02,092 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8827586206896552 [2024-10-14 17:20:02,092 INFO L175 Difference]: Start difference. First operand has 161 places, 154 transitions, 492 flow. Second operand 3 states and 384 transitions. [2024-10-14 17:20:02,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 161 transitions, 606 flow [2024-10-14 17:20:02,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 161 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:20:02,101 INFO L231 Difference]: Finished difference. Result has 164 places, 157 transitions, 524 flow [2024-10-14 17:20:02,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=164, PETRI_TRANSITIONS=157} [2024-10-14 17:20:02,101 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 17 predicate places. [2024-10-14 17:20:02,102 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 157 transitions, 524 flow [2024-10-14 17:20:02,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-14 17:20:02,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:20:02,102 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-10-14 17:20:02,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 17:20:02,102 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-14 17:20:02,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:20:02,103 INFO L85 PathProgramCache]: Analyzing trace with hash 535690515, now seen corresponding path program 1 times [2024-10-14 17:20:02,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:20:02,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613349744] [2024-10-14 17:20:02,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:20:02,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:20:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:20:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-14 17:20:02,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:20:02,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613349744] [2024-10-14 17:20:02,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613349744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:20:02,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:20:02,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:20:02,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383557588] [2024-10-14 17:20:02,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:20:02,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:20:02,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:20:02,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:20:02,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:20:02,159 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2024-10-14 17:20:02,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 157 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-14 17:20:02,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:20:02,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2024-10-14 17:20:02,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:20:03,030 INFO L124 PetriNetUnfolderBase]: 1121/8023 cut-off events. [2024-10-14 17:20:03,031 INFO L125 PetriNetUnfolderBase]: For 8757/8909 co-relation queries the response was YES. [2024-10-14 17:20:03,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16443 conditions, 8023 events. 1121/8023 cut-off events. For 8757/8909 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 96497 event pairs, 707 based on Foata normal form. 4/7570 useless extension candidates. Maximal degree in co-relation 13158. Up to 2095 conditions per place. [2024-10-14 17:20:03,064 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 33 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2024-10-14 17:20:03,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 163 transitions, 629 flow [2024-10-14 17:20:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:20:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:20:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2024-10-14 17:20:03,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8804597701149425 [2024-10-14 17:20:03,065 INFO L175 Difference]: Start difference. First operand has 164 places, 157 transitions, 524 flow. Second operand 3 states and 383 transitions. [2024-10-14 17:20:03,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 163 transitions, 629 flow [2024-10-14 17:20:03,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 163 transitions, 615 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-14 17:20:03,076 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 552 flow [2024-10-14 17:20:03,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2024-10-14 17:20:03,076 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 19 predicate places. [2024-10-14 17:20:03,076 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 552 flow [2024-10-14 17:20:03,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-14 17:20:03,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:20:03,077 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:20:03,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 17:20:03,077 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-14 17:20:03,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:20:03,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1938862278, now seen corresponding path program 1 times [2024-10-14 17:20:03,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:20:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652562326] [2024-10-14 17:20:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:20:03,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:20:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:20:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:20:03,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:20:03,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652562326] [2024-10-14 17:20:03,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652562326] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:20:03,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195619421] [2024-10-14 17:20:03,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:20:03,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:20:03,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:20:03,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:20:03,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 17:20:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:20:03,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:20:03,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:20:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:20:03,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:20:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:20:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195619421] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:20:03,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:20:03,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-14 17:20:03,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684889932] [2024-10-14 17:20:03,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:20:03,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:20:03,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:20:03,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:20:03,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:20:03,881 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 145 [2024-10-14 17:20:03,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 552 flow. Second operand has 16 states, 16 states have (on average 111.8125) internal successors, (1789), 16 states have internal predecessors, (1789), 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-14 17:20:03,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:20:03,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 145 [2024-10-14 17:20:03,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:20:05,083 INFO L124 PetriNetUnfolderBase]: 2232/9384 cut-off events. [2024-10-14 17:20:05,083 INFO L125 PetriNetUnfolderBase]: For 5324/5534 co-relation queries the response was YES. [2024-10-14 17:20:05,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18833 conditions, 9384 events. 2232/9384 cut-off events. For 5324/5534 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 97035 event pairs, 170 based on Foata normal form. 110/9234 useless extension candidates. Maximal degree in co-relation 9495. Up to 1097 conditions per place. [2024-10-14 17:20:05,120 INFO L140 encePairwiseOnDemand]: 132/145 looper letters, 101 selfloop transitions, 16 changer transitions 22/262 dead transitions. [2024-10-14 17:20:05,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 262 transitions, 1166 flow [2024-10-14 17:20:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 17:20:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-10-14 17:20:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1774 transitions. [2024-10-14 17:20:05,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8156321839080459 [2024-10-14 17:20:05,122 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 552 flow. Second operand 15 states and 1774 transitions. [2024-10-14 17:20:05,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 262 transitions, 1166 flow [2024-10-14 17:20:05,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 262 transitions, 1150 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-14 17:20:05,133 INFO L231 Difference]: Finished difference. Result has 184 places, 167 transitions, 620 flow [2024-10-14 17:20:05,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=620, PETRI_PLACES=184, PETRI_TRANSITIONS=167} [2024-10-14 17:20:05,134 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 37 predicate places. [2024-10-14 17:20:05,134 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 167 transitions, 620 flow [2024-10-14 17:20:05,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 111.8125) internal successors, (1789), 16 states have internal predecessors, (1789), 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-14 17:20:05,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:20:05,135 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 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-14 17:20:05,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 17:20:05,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:20:05,336 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-14 17:20:05,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:20:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash -508767168, now seen corresponding path program 1 times [2024-10-14 17:20:05,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:20:05,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952577692] [2024-10-14 17:20:05,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:20:05,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:20:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:20:05,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 17:20:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:20:05,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 17:20:05,394 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 17:20:05,394 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-10-14 17:20:05,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-10-14 17:20:05,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-10-14 17:20:05,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-10-14 17:20:05,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-10-14 17:20:05,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-10-14 17:20:05,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-10-14 17:20:05,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-10-14 17:20:05,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-10-14 17:20:05,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 17:20:05,396 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:20:05,397 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 17:20:05,397 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-14 17:20:05,413 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-10-14 17:20:05,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 163 transitions, 381 flow [2024-10-14 17:20:05,489 INFO L124 PetriNetUnfolderBase]: 93/1046 cut-off events. [2024-10-14 17:20:05,489 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-10-14 17:20:05,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 1046 events. 93/1046 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4924 event pairs, 23 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 637. Up to 80 conditions per place. [2024-10-14 17:20:05,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 163 transitions, 381 flow [2024-10-14 17:20:05,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 163 transitions, 381 flow [2024-10-14 17:20:05,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:20:05,496 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;@2e2e3ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:20:05,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-14 17:20:05,498 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:20:05,498 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-14 17:20:05,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:20:05,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:20:05,499 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] [2024-10-14 17:20:05,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-14 17:20:05,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:20:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash -143201679, now seen corresponding path program 1 times [2024-10-14 17:20:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:20:05,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286316963] [2024-10-14 17:20:05,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:20:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:20:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:20:05,511 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-14 17:20:05,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:20:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286316963] [2024-10-14 17:20:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286316963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:20:05,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:20:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:20:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954318504] [2024-10-14 17:20:05,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:20:05,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:20:05,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:20:05,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:20:05,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:20:05,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2024-10-14 17:20:05,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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-14 17:20:05,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:20:05,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2024-10-14 17:20:05,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand