./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.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 da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:11:00,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:11:00,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:11:00,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:11:00,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:11:00,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:11:00,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:11:00,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:11:00,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:11:00,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:11:00,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:11:00,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:11:00,619 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:11:00,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:11:00,620 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:11:00,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:11:00,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:11:00,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:11:00,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:11:00,621 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:11:00,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:11:00,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:11:00,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:11:00,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:11:00,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:11:00,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:11:00,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:11:00,621 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee [2025-03-08 22:11:00,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:11:00,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:11:00,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:11:00,833 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:11:00,833 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:11:00,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2025-03-08 22:11:01,972 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f5e40e35/45f7ce5e3f4445ada3de711f5b39d770/FLAGc7bf7c7e6 [2025-03-08 22:11:02,274 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:11:02,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2025-03-08 22:11:02,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f5e40e35/45f7ce5e3f4445ada3de711f5b39d770/FLAGc7bf7c7e6 [2025-03-08 22:11:02,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f5e40e35/45f7ce5e3f4445ada3de711f5b39d770 [2025-03-08 22:11:02,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:11:02,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:11:02,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:11:02,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:11:02,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:11:02,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:02,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27af3f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02, skipping insertion in model container [2025-03-08 22:11:02,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:02,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:11:02,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:11:02,899 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:11:02,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:11:02,974 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:11:02,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02 WrapperNode [2025-03-08 22:11:02,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:11:02,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:11:02,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:11:02,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:11:02,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:02,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:03,006 INFO L138 Inliner]: procedures = 263, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-03-08 22:11:03,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:11:03,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:11:03,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:11:03,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:11:03,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:03,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:03,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:03,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:03,020 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:03,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:03,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:03,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:03,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:11:03,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:11:03,026 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:11:03,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:11:03,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (1/1) ... [2025-03-08 22:11:03,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:11:03,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:11:03,050 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) [2025-03-08 22:11:03,052 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 [2025-03-08 22:11:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 22:11:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:11:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:11:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:11:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:11:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 22:11:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-08 22:11:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-08 22:11:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:11:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:11:03,068 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:11:03,152 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:11:03,154 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:11:03,400 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:11:03,401 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:11:03,409 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:11:03,410 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:11:03,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:03 BoogieIcfgContainer [2025-03-08 22:11:03,410 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:11:03,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:11:03,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:11:03,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:11:03,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:11:02" (1/3) ... [2025-03-08 22:11:03,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d9cd0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:11:03, skipping insertion in model container [2025-03-08 22:11:03,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:02" (2/3) ... [2025-03-08 22:11:03,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d9cd0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:11:03, skipping insertion in model container [2025-03-08 22:11:03,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:03" (3/3) ... [2025-03-08 22:11:03,416 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i [2025-03-08 22:11:03,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:11:03,426 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-tid.i that has 2 procedures, 106 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-08 22:11:03,427 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:11:03,472 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:11:03,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 108 transitions, 223 flow [2025-03-08 22:11:03,540 INFO L124 PetriNetUnfolderBase]: 2/156 cut-off events. [2025-03-08 22:11:03,542 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:11:03,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 156 events. 2/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 219 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2025-03-08 22:11:03,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 108 transitions, 223 flow [2025-03-08 22:11:03,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 108 transitions, 223 flow [2025-03-08 22:11:03,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:03,570 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;@4796941c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:03,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-08 22:11:03,585 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:03,585 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-03-08 22:11:03,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:03,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:03,586 INFO L206 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] [2025-03-08 22:11:03,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:03,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash -90682818, now seen corresponding path program 1 times [2025-03-08 22:11:03,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:03,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598948410] [2025-03-08 22:11:03,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:03,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:11:03,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:11:03,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:03,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:03,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:03,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:03,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598948410] [2025-03-08 22:11:03,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598948410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:03,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:03,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842810984] [2025-03-08 22:11:03,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:03,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:11:03,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:03,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:11:03,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:11:04,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2025-03-08 22:11:04,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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) [2025-03-08 22:11:04,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:04,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2025-03-08 22:11:04,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:04,060 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-03-08 22:11:04,061 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:11:04,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 161 events. 1/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 185 event pairs, 0 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 39. Up to 16 conditions per place. [2025-03-08 22:11:04,062 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 11 selfloop transitions, 2 changer transitions 6/112 dead transitions. [2025-03-08 22:11:04,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 112 transitions, 267 flow [2025-03-08 22:11:04,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2025-03-08 22:11:04,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9012345679012346 [2025-03-08 22:11:04,075 INFO L175 Difference]: Start difference. First operand has 109 places, 108 transitions, 223 flow. Second operand 6 states and 584 transitions. [2025-03-08 22:11:04,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 112 transitions, 267 flow [2025-03-08 22:11:04,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:04,083 INFO L231 Difference]: Finished difference. Result has 118 places, 106 transitions, 237 flow [2025-03-08 22:11:04,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=118, PETRI_TRANSITIONS=106} [2025-03-08 22:11:04,088 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 9 predicate places. [2025-03-08 22:11:04,089 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 106 transitions, 237 flow [2025-03-08 22:11:04,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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) [2025-03-08 22:11:04,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:04,090 INFO L206 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] [2025-03-08 22:11:04,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:11:04,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:04,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1368358570, now seen corresponding path program 1 times [2025-03-08 22:11:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:04,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610497416] [2025-03-08 22:11:04,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:04,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:11:04,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:11:04,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:04,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:04,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:04,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610497416] [2025-03-08 22:11:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610497416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:04,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:04,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931016115] [2025-03-08 22:11:04,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:04,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:04,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:04,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:04,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:04,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 108 [2025-03-08 22:11:04,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 106 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:11:04,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:04,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 108 [2025-03-08 22:11:04,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:04,875 INFO L124 PetriNetUnfolderBase]: 106/500 cut-off events. [2025-03-08 22:11:04,876 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-08 22:11:04,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 500 events. 106/500 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2433 event pairs, 68 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 692. Up to 240 conditions per place. [2025-03-08 22:11:04,880 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 35 selfloop transitions, 22 changer transitions 0/127 dead transitions. [2025-03-08 22:11:04,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 127 transitions, 393 flow [2025-03-08 22:11:04,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2025-03-08 22:11:04,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2025-03-08 22:11:04,884 INFO L175 Difference]: Start difference. First operand has 118 places, 106 transitions, 237 flow. Second operand 6 states and 484 transitions. [2025-03-08 22:11:04,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 127 transitions, 393 flow [2025-03-08 22:11:04,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 127 transitions, 379 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:04,888 INFO L231 Difference]: Finished difference. Result has 119 places, 127 transitions, 373 flow [2025-03-08 22:11:04,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=373, PETRI_PLACES=119, PETRI_TRANSITIONS=127} [2025-03-08 22:11:04,889 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2025-03-08 22:11:04,889 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 127 transitions, 373 flow [2025-03-08 22:11:04,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:11:04,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:04,889 INFO L206 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] [2025-03-08 22:11:04,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:11:04,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:04,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash -800255098, now seen corresponding path program 1 times [2025-03-08 22:11:04,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:04,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910695292] [2025-03-08 22:11:04,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:04,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:04,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:11:04,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:11:04,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:04,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:05,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:05,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910695292] [2025-03-08 22:11:05,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910695292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:05,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:05,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:05,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317849891] [2025-03-08 22:11:05,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:05,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:05,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:05,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:05,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:05,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 108 [2025-03-08 22:11:05,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 127 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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) [2025-03-08 22:11:05,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:05,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 108 [2025-03-08 22:11:05,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:05,392 INFO L124 PetriNetUnfolderBase]: 125/565 cut-off events. [2025-03-08 22:11:05,392 INFO L125 PetriNetUnfolderBase]: For 108/114 co-relation queries the response was YES. [2025-03-08 22:11:05,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 565 events. 125/565 cut-off events. For 108/114 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2809 event pairs, 55 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 998. Up to 268 conditions per place. [2025-03-08 22:11:05,397 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 52 selfloop transitions, 22 changer transitions 0/148 dead transitions. [2025-03-08 22:11:05,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 595 flow [2025-03-08 22:11:05,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-03-08 22:11:05,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7623456790123457 [2025-03-08 22:11:05,399 INFO L175 Difference]: Start difference. First operand has 119 places, 127 transitions, 373 flow. Second operand 6 states and 494 transitions. [2025-03-08 22:11:05,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 148 transitions, 595 flow [2025-03-08 22:11:05,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 148 transitions, 595 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:05,403 INFO L231 Difference]: Finished difference. Result has 129 places, 148 transitions, 555 flow [2025-03-08 22:11:05,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=129, PETRI_TRANSITIONS=148} [2025-03-08 22:11:05,404 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places. [2025-03-08 22:11:05,405 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 148 transitions, 555 flow [2025-03-08 22:11:05,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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) [2025-03-08 22:11:05,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:05,405 INFO L206 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] [2025-03-08 22:11:05,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:11:05,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:05,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:05,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1947607354, now seen corresponding path program 1 times [2025-03-08 22:11:05,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:05,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469339966] [2025-03-08 22:11:05,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:05,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:11:05,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:11:05,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:05,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:05,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:05,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469339966] [2025-03-08 22:11:05,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469339966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:05,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:05,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:05,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402865533] [2025-03-08 22:11:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:05,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:05,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:05,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:05,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:05,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2025-03-08 22:11:05,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 148 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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) [2025-03-08 22:11:05,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:05,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2025-03-08 22:11:05,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:06,076 INFO L124 PetriNetUnfolderBase]: 283/933 cut-off events. [2025-03-08 22:11:06,076 INFO L125 PetriNetUnfolderBase]: For 443/479 co-relation queries the response was YES. [2025-03-08 22:11:06,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 933 events. 283/933 cut-off events. For 443/479 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5285 event pairs, 47 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 2159. Up to 489 conditions per place. [2025-03-08 22:11:06,082 INFO L140 encePairwiseOnDemand]: 85/108 looper letters, 60 selfloop transitions, 90 changer transitions 7/229 dead transitions. [2025-03-08 22:11:06,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 229 transitions, 1163 flow [2025-03-08 22:11:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 557 transitions. [2025-03-08 22:11:06,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8595679012345679 [2025-03-08 22:11:06,085 INFO L175 Difference]: Start difference. First operand has 129 places, 148 transitions, 555 flow. Second operand 6 states and 557 transitions. [2025-03-08 22:11:06,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 229 transitions, 1163 flow [2025-03-08 22:11:06,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 229 transitions, 1125 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:06,094 INFO L231 Difference]: Finished difference. Result has 139 places, 222 transitions, 1239 flow [2025-03-08 22:11:06,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1239, PETRI_PLACES=139, PETRI_TRANSITIONS=222} [2025-03-08 22:11:06,096 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 30 predicate places. [2025-03-08 22:11:06,096 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 222 transitions, 1239 flow [2025-03-08 22:11:06,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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) [2025-03-08 22:11:06,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:06,097 INFO L206 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] [2025-03-08 22:11:06,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:11:06,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:06,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:06,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1593160032, now seen corresponding path program 1 times [2025-03-08 22:11:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:06,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251917143] [2025-03-08 22:11:06,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:06,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:06,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 22:11:06,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:11:06,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:06,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:06,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:06,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251917143] [2025-03-08 22:11:06,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251917143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:06,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:06,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:06,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812635949] [2025-03-08 22:11:06,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:06,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:06,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:06,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:06,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:06,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 108 [2025-03-08 22:11:06,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 222 transitions, 1239 flow. Second operand has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 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) [2025-03-08 22:11:06,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:06,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 108 [2025-03-08 22:11:06,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:06,713 INFO L124 PetriNetUnfolderBase]: 282/973 cut-off events. [2025-03-08 22:11:06,714 INFO L125 PetriNetUnfolderBase]: For 1094/1186 co-relation queries the response was YES. [2025-03-08 22:11:06,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 973 events. 282/973 cut-off events. For 1094/1186 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6042 event pairs, 18 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 2922. Up to 400 conditions per place. [2025-03-08 22:11:06,720 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 125 selfloop transitions, 36 changer transitions 0/252 dead transitions. [2025-03-08 22:11:06,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 252 transitions, 1770 flow [2025-03-08 22:11:06,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2025-03-08 22:11:06,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7808641975308642 [2025-03-08 22:11:06,723 INFO L175 Difference]: Start difference. First operand has 139 places, 222 transitions, 1239 flow. Second operand 6 states and 506 transitions. [2025-03-08 22:11:06,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 252 transitions, 1770 flow [2025-03-08 22:11:06,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 252 transitions, 1734 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:06,737 INFO L231 Difference]: Finished difference. Result has 141 places, 251 transitions, 1589 flow [2025-03-08 22:11:06,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1589, PETRI_PLACES=141, PETRI_TRANSITIONS=251} [2025-03-08 22:11:06,739 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 32 predicate places. [2025-03-08 22:11:06,740 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 251 transitions, 1589 flow [2025-03-08 22:11:06,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 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) [2025-03-08 22:11:06,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:06,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:06,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:11:06,740 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:06,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1625837938, now seen corresponding path program 1 times [2025-03-08 22:11:06,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:06,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242414133] [2025-03-08 22:11:06,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:06,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:06,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 22:11:06,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 22:11:06,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:06,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:06,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:06,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242414133] [2025-03-08 22:11:06,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242414133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:06,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:06,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:06,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362142594] [2025-03-08 22:11:06,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:06,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:06,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:06,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:06,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:07,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 108 [2025-03-08 22:11:07,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 251 transitions, 1589 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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) [2025-03-08 22:11:07,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:07,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 108 [2025-03-08 22:11:07,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:07,274 INFO L124 PetriNetUnfolderBase]: 324/1067 cut-off events. [2025-03-08 22:11:07,274 INFO L125 PetriNetUnfolderBase]: For 1941/2035 co-relation queries the response was YES. [2025-03-08 22:11:07,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 1067 events. 324/1067 cut-off events. For 1941/2035 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6747 event pairs, 21 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 3604. Up to 441 conditions per place. [2025-03-08 22:11:07,280 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 136 selfloop transitions, 37 changer transitions 29/291 dead transitions. [2025-03-08 22:11:07,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 291 transitions, 2350 flow [2025-03-08 22:11:07,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2025-03-08 22:11:07,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395061728395061 [2025-03-08 22:11:07,283 INFO L175 Difference]: Start difference. First operand has 141 places, 251 transitions, 1589 flow. Second operand 6 states and 544 transitions. [2025-03-08 22:11:07,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 291 transitions, 2350 flow [2025-03-08 22:11:07,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 291 transitions, 2192 flow, removed 79 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:07,301 INFO L231 Difference]: Finished difference. Result has 151 places, 262 transitions, 1852 flow [2025-03-08 22:11:07,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1852, PETRI_PLACES=151, PETRI_TRANSITIONS=262} [2025-03-08 22:11:07,303 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 42 predicate places. [2025-03-08 22:11:07,303 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 262 transitions, 1852 flow [2025-03-08 22:11:07,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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) [2025-03-08 22:11:07,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:07,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:07,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:11:07,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:07,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:07,304 INFO L85 PathProgramCache]: Analyzing trace with hash -811156847, now seen corresponding path program 1 times [2025-03-08 22:11:07,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:07,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851281588] [2025-03-08 22:11:07,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:07,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:07,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:11:07,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:11:07,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:07,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:07,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:07,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851281588] [2025-03-08 22:11:07,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851281588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:07,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:07,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:11:07,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785815223] [2025-03-08 22:11:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:07,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:11:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:07,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:11:07,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:11:08,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 108 [2025-03-08 22:11:08,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 262 transitions, 1852 flow. Second operand has 14 states, 14 states have (on average 65.85714285714286) internal successors, (922), 14 states have internal predecessors, (922), 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) [2025-03-08 22:11:08,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:08,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 108 [2025-03-08 22:11:08,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:09,445 INFO L124 PetriNetUnfolderBase]: 405/1210 cut-off events. [2025-03-08 22:11:09,446 INFO L125 PetriNetUnfolderBase]: For 2541/2592 co-relation queries the response was YES. [2025-03-08 22:11:09,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 1210 events. 405/1210 cut-off events. For 2541/2592 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7658 event pairs, 23 based on Foata normal form. 46/1252 useless extension candidates. Maximal degree in co-relation 4626. Up to 329 conditions per place. [2025-03-08 22:11:09,452 INFO L140 encePairwiseOnDemand]: 83/108 looper letters, 206 selfloop transitions, 166 changer transitions 0/426 dead transitions. [2025-03-08 22:11:09,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 426 transitions, 3726 flow [2025-03-08 22:11:09,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 22:11:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-08 22:11:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2510 transitions. [2025-03-08 22:11:09,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6455761316872428 [2025-03-08 22:11:09,457 INFO L175 Difference]: Start difference. First operand has 151 places, 262 transitions, 1852 flow. Second operand 36 states and 2510 transitions. [2025-03-08 22:11:09,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 426 transitions, 3726 flow [2025-03-08 22:11:09,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 426 transitions, 3642 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:09,478 INFO L231 Difference]: Finished difference. Result has 183 places, 330 transitions, 2820 flow [2025-03-08 22:11:09,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2820, PETRI_PLACES=183, PETRI_TRANSITIONS=330} [2025-03-08 22:11:09,479 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 74 predicate places. [2025-03-08 22:11:09,479 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 330 transitions, 2820 flow [2025-03-08 22:11:09,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 65.85714285714286) internal successors, (922), 14 states have internal predecessors, (922), 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) [2025-03-08 22:11:09,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:09,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:09,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:11:09,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:09,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1629204000, now seen corresponding path program 1 times [2025-03-08 22:11:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142966941] [2025-03-08 22:11:09,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:09,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:11:09,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:11:09,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:09,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:09,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:09,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142966941] [2025-03-08 22:11:09,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142966941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:09,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:09,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:11:09,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868004108] [2025-03-08 22:11:09,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:09,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:11:09,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:09,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:11:09,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:11:10,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 108 [2025-03-08 22:11:10,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 330 transitions, 2820 flow. Second operand has 14 states, 14 states have (on average 66.85714285714286) internal successors, (936), 14 states have internal predecessors, (936), 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) [2025-03-08 22:11:10,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:10,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 108 [2025-03-08 22:11:10,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:11,126 INFO L124 PetriNetUnfolderBase]: 402/1290 cut-off events. [2025-03-08 22:11:11,126 INFO L125 PetriNetUnfolderBase]: For 4824/4854 co-relation queries the response was YES. [2025-03-08 22:11:11,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5744 conditions, 1290 events. 402/1290 cut-off events. For 4824/4854 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8460 event pairs, 13 based on Foata normal form. 13/1298 useless extension candidates. Maximal degree in co-relation 5596. Up to 343 conditions per place. [2025-03-08 22:11:11,137 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 253 selfloop transitions, 73 changer transitions 0/418 dead transitions. [2025-03-08 22:11:11,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 418 transitions, 4401 flow [2025-03-08 22:11:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 22:11:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-08 22:11:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1808 transitions. [2025-03-08 22:11:11,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6438746438746439 [2025-03-08 22:11:11,143 INFO L175 Difference]: Start difference. First operand has 183 places, 330 transitions, 2820 flow. Second operand 26 states and 1808 transitions. [2025-03-08 22:11:11,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 418 transitions, 4401 flow [2025-03-08 22:11:11,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 418 transitions, 4147 flow, removed 100 selfloop flow, removed 8 redundant places. [2025-03-08 22:11:11,177 INFO L231 Difference]: Finished difference. Result has 205 places, 355 transitions, 3066 flow [2025-03-08 22:11:11,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3066, PETRI_PLACES=205, PETRI_TRANSITIONS=355} [2025-03-08 22:11:11,179 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 96 predicate places. [2025-03-08 22:11:11,179 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 355 transitions, 3066 flow [2025-03-08 22:11:11,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 66.85714285714286) internal successors, (936), 14 states have internal predecessors, (936), 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) [2025-03-08 22:11:11,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:11,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:11,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:11:11,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:11,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:11,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1774847060, now seen corresponding path program 2 times [2025-03-08 22:11:11,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:11,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243394305] [2025-03-08 22:11:11,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:11:11,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:11,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:11:11,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:11:11,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:11:11,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:11,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:11,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243394305] [2025-03-08 22:11:11,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243394305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:11,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:11,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:11:11,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838897352] [2025-03-08 22:11:11,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:11,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:11:11,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:11,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:11:11,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:11:12,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 108 [2025-03-08 22:11:12,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 355 transitions, 3066 flow. Second operand has 14 states, 14 states have (on average 66.85714285714286) internal successors, (936), 14 states have internal predecessors, (936), 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) [2025-03-08 22:11:12,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:12,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 108 [2025-03-08 22:11:12,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:12,779 INFO L124 PetriNetUnfolderBase]: 493/1582 cut-off events. [2025-03-08 22:11:12,780 INFO L125 PetriNetUnfolderBase]: For 6112/6219 co-relation queries the response was YES. [2025-03-08 22:11:12,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7071 conditions, 1582 events. 493/1582 cut-off events. For 6112/6219 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 11355 event pairs, 12 based on Foata normal form. 23/1593 useless extension candidates. Maximal degree in co-relation 6917. Up to 446 conditions per place. [2025-03-08 22:11:12,792 INFO L140 encePairwiseOnDemand]: 88/108 looper letters, 245 selfloop transitions, 95 changer transitions 0/432 dead transitions. [2025-03-08 22:11:12,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 432 transitions, 4576 flow [2025-03-08 22:11:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 22:11:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-08 22:11:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1538 transitions. [2025-03-08 22:11:12,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6473063973063973 [2025-03-08 22:11:12,795 INFO L175 Difference]: Start difference. First operand has 205 places, 355 transitions, 3066 flow. Second operand 22 states and 1538 transitions. [2025-03-08 22:11:12,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 432 transitions, 4576 flow [2025-03-08 22:11:12,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 432 transitions, 4507 flow, removed 0 selfloop flow, removed 16 redundant places. [2025-03-08 22:11:12,836 INFO L231 Difference]: Finished difference. Result has 216 places, 386 transitions, 3741 flow [2025-03-08 22:11:12,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2997, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3741, PETRI_PLACES=216, PETRI_TRANSITIONS=386} [2025-03-08 22:11:12,837 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 107 predicate places. [2025-03-08 22:11:12,837 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 386 transitions, 3741 flow [2025-03-08 22:11:12,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 66.85714285714286) internal successors, (936), 14 states have internal predecessors, (936), 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) [2025-03-08 22:11:12,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:12,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:12,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:11:12,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:12,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:12,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1312682788, now seen corresponding path program 3 times [2025-03-08 22:11:12,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:12,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463830125] [2025-03-08 22:11:12,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:11:12,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:12,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 2 equivalence classes. [2025-03-08 22:11:12,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:11:12,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:11:12,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:13,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:13,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463830125] [2025-03-08 22:11:13,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463830125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:11:13,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111314430] [2025-03-08 22:11:13,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:11:13,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:11:13,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:11:13,206 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) [2025-03-08 22:11:13,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:11:13,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 2 equivalence classes. [2025-03-08 22:11:13,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:11:13,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:11:13,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:13,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 22:11:13,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:11:13,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:11:13,590 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:11:13,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:11:13,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:11:13,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 22:11:13,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 22:11:13,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-08 22:11:14,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2025-03-08 22:11:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:14,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:12:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:08,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111314430] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:12:08,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:12:08,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 39 [2025-03-08 22:12:08,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646187641] [2025-03-08 22:12:08,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:12:08,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 22:12:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:08,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 22:12:08,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1337, Unknown=12, NotChecked=0, Total=1560 [2025-03-08 22:12:12,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:12:17,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:12:21,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:12:22,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:12:27,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:12:31,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:12:35,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:12:39,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:12:42,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]