./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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-index-inc-race.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 dcbcb8208024116480c974e9f1bc8db6725056562df0982447c3fb673ff0c0ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:17:29,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:17:29,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:17:29,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:17:29,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:17:29,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:17:29,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:17:29,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:17:29,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:17:29,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:17:29,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:17:29,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:17:29,388 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:17:29,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:17:29,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:17:29,388 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:17:29,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:17:29,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:17:29,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:17:29,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:17:29,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:17:29,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:17:29,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:17:29,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:17:29,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:17:29,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:17:29,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:17:29,390 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 -> dcbcb8208024116480c974e9f1bc8db6725056562df0982447c3fb673ff0c0ec [2025-03-17 11:17:29,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:17:29,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:17:29,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:17:29,651 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:17:29,651 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:17:29,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i [2025-03-17 11:17:30,806 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d707bc1c3/201555dc758548b6bb07e56f4138e2cf/FLAGbaf932c33 [2025-03-17 11:17:31,075 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:17:31,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i [2025-03-17 11:17:31,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d707bc1c3/201555dc758548b6bb07e56f4138e2cf/FLAGbaf932c33 [2025-03-17 11:17:31,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d707bc1c3/201555dc758548b6bb07e56f4138e2cf [2025-03-17 11:17:31,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:17:31,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:17:31,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:17:31,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:17:31,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:17:31,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba44762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31, skipping insertion in model container [2025-03-17 11:17:31,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:17:31,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:17:31,505 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:17:31,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:17:31,592 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:17:31,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31 WrapperNode [2025-03-17 11:17:31,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:17:31,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:17:31,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:17:31,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:17:31,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,637 INFO L138 Inliner]: procedures = 273, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-03-17 11:17:31,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:17:31,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:17:31,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:17:31,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:17:31,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:17:31,670 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:17:31,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:17:31,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:17:31,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31" (1/1) ... [2025-03-17 11:17:31,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:17:31,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:17:31,693 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-17 11:17:31,695 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-17 11:17:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:17:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:17:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:17:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:17:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-17 11:17:31,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-17 11:17:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:17:31,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:17:31,712 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:17:31,797 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:17:31,798 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:17:31,989 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:17:31,990 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:17:31,998 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:17:31,999 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:17:31,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:17:31 BoogieIcfgContainer [2025-03-17 11:17:31,999 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:17:32,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:17:32,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:17:32,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:17:32,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:17:31" (1/3) ... [2025-03-17 11:17:32,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7e8d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:17:32, skipping insertion in model container [2025-03-17 11:17:32,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:17:31" (2/3) ... [2025-03-17 11:17:32,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7e8d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:17:32, skipping insertion in model container [2025-03-17 11:17:32,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:17:31" (3/3) ... [2025-03-17 11:17:32,007 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-inc-race.i [2025-03-17 11:17:32,019 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:17:32,020 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-inc-race.i that has 2 procedures, 108 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-03-17 11:17:32,021 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:17:32,078 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:17:32,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 110 transitions, 227 flow [2025-03-17 11:17:32,183 INFO L124 PetriNetUnfolderBase]: 2/143 cut-off events. [2025-03-17 11:17:32,185 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:17:32,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 143 events. 2/143 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 254 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 63. Up to 3 conditions per place. [2025-03-17 11:17:32,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 110 transitions, 227 flow [2025-03-17 11:17:32,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 110 transitions, 227 flow [2025-03-17 11:17:32,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:17:32,207 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;@3f3d47c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:17:32,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-17 11:17:32,216 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:17:32,216 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-03-17 11:17:32,217 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:17:32,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:32,217 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] [2025-03-17 11:17:32,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:17:32,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash 111822956, now seen corresponding path program 1 times [2025-03-17 11:17:32,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:32,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816286926] [2025-03-17 11:17:32,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:32,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:17:32,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:17:32,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:32,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:32,422 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-17 11:17:32,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:32,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816286926] [2025-03-17 11:17:32,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816286926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:32,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:32,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:17:32,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715436626] [2025-03-17 11:17:32,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:32,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:17:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:32,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:17:32,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:17:32,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 110 [2025-03-17 11:17:32,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-17 11:17:32,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:32,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 110 [2025-03-17 11:17:32,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:32,517 INFO L124 PetriNetUnfolderBase]: 3/151 cut-off events. [2025-03-17 11:17:32,517 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-17 11:17:32,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 151 events. 3/151 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 306 event pairs, 2 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 90. Up to 15 conditions per place. [2025-03-17 11:17:32,521 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 8 selfloop transitions, 2 changer transitions 1/108 dead transitions. [2025-03-17 11:17:32,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 108 transitions, 243 flow [2025-03-17 11:17:32,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:17:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:17:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2025-03-17 11:17:32,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9272727272727272 [2025-03-17 11:17:32,539 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 227 flow. Second operand 3 states and 306 transitions. [2025-03-17 11:17:32,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 108 transitions, 243 flow [2025-03-17 11:17:32,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:17:32,549 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 225 flow [2025-03-17 11:17:32,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2025-03-17 11:17:32,555 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2025-03-17 11:17:32,555 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 225 flow [2025-03-17 11:17:32,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-17 11:17:32,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:32,555 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] [2025-03-17 11:17:32,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:17:32,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:17:32,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:32,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1749512171, now seen corresponding path program 1 times [2025-03-17 11:17:32,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:32,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925615786] [2025-03-17 11:17:32,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:32,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:32,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:17:32,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:17:32,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:32,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:32,633 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-17 11:17:32,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:32,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925615786] [2025-03-17 11:17:32,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925615786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:32,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:32,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:17:32,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481260599] [2025-03-17 11:17:32,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:32,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:17:32,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:32,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:17:32,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:17:32,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 110 [2025-03-17 11:17:32,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-17 11:17:32,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:32,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 110 [2025-03-17 11:17:32,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:32,672 INFO L124 PetriNetUnfolderBase]: 5/190 cut-off events. [2025-03-17 11:17:32,672 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 11:17:32,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 190 events. 5/190 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 414 event pairs, 2 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 184. Up to 16 conditions per place. [2025-03-17 11:17:32,676 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 7 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-03-17 11:17:32,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 107 transitions, 243 flow [2025-03-17 11:17:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:17:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:17:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2025-03-17 11:17:32,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9424242424242424 [2025-03-17 11:17:32,679 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 225 flow. Second operand 3 states and 311 transitions. [2025-03-17 11:17:32,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 107 transitions, 243 flow [2025-03-17 11:17:32,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:17:32,682 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 231 flow [2025-03-17 11:17:32,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2025-03-17 11:17:32,683 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -1 predicate places. [2025-03-17 11:17:32,683 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 231 flow [2025-03-17 11:17:32,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-17 11:17:32,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:32,683 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] [2025-03-17 11:17:32,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:17:32,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:17:32,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash 392384765, now seen corresponding path program 1 times [2025-03-17 11:17:32,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:32,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587180358] [2025-03-17 11:17:32,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:32,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:32,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:17:32,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:17:32,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:32,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:33,113 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-17 11:17:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587180358] [2025-03-17 11:17:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587180358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:33,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:33,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:17:33,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219460860] [2025-03-17 11:17:33,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:33,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:17:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:33,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:17:33,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:17:33,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 110 [2025-03-17 11:17:33,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-17 11:17:33,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:33,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 110 [2025-03-17 11:17:33,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:33,385 INFO L124 PetriNetUnfolderBase]: 73/418 cut-off events. [2025-03-17 11:17:33,386 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:17:33,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 418 events. 73/418 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1973 event pairs, 35 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 516. Up to 159 conditions per place. [2025-03-17 11:17:33,389 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 23 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2025-03-17 11:17:33,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 128 transitions, 363 flow [2025-03-17 11:17:33,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:17:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:17:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2025-03-17 11:17:33,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8424242424242424 [2025-03-17 11:17:33,392 INFO L175 Difference]: Start difference. First operand has 110 places, 107 transitions, 231 flow. Second operand 6 states and 556 transitions. [2025-03-17 11:17:33,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 128 transitions, 363 flow [2025-03-17 11:17:33,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 128 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:17:33,396 INFO L231 Difference]: Finished difference. Result has 120 places, 128 transitions, 381 flow [2025-03-17 11:17:33,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=381, PETRI_PLACES=120, PETRI_TRANSITIONS=128} [2025-03-17 11:17:33,397 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2025-03-17 11:17:33,397 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 128 transitions, 381 flow [2025-03-17 11:17:33,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-17 11:17:33,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:33,398 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] [2025-03-17 11:17:33,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:17:33,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:17:33,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:33,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1963990068, now seen corresponding path program 1 times [2025-03-17 11:17:33,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:33,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498350741] [2025-03-17 11:17:33,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:33,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:33,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:17:33,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:17:33,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:33,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:33,488 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-17 11:17:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:33,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498350741] [2025-03-17 11:17:33,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498350741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:33,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:33,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:17:33,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663046346] [2025-03-17 11:17:33,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:33,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:17:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:33,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:17:33,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:17:33,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2025-03-17 11:17:33,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 128 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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-17 11:17:33,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:33,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2025-03-17 11:17:33,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:33,620 INFO L124 PetriNetUnfolderBase]: 31/275 cut-off events. [2025-03-17 11:17:33,620 INFO L125 PetriNetUnfolderBase]: For 32/49 co-relation queries the response was YES. [2025-03-17 11:17:33,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 275 events. 31/275 cut-off events. For 32/49 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 912 event pairs, 0 based on Foata normal form. 2/262 useless extension candidates. Maximal degree in co-relation 344. Up to 49 conditions per place. [2025-03-17 11:17:33,625 INFO L140 encePairwiseOnDemand]: 102/110 looper letters, 11 selfloop transitions, 2 changer transitions 5/133 dead transitions. [2025-03-17 11:17:33,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 133 transitions, 427 flow [2025-03-17 11:17:33,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:17:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:17:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions. [2025-03-17 11:17:33,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015151515151515 [2025-03-17 11:17:33,628 INFO L175 Difference]: Start difference. First operand has 120 places, 128 transitions, 381 flow. Second operand 6 states and 595 transitions. [2025-03-17 11:17:33,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 133 transitions, 427 flow [2025-03-17 11:17:33,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 427 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:17:33,633 INFO L231 Difference]: Finished difference. Result has 129 places, 128 transitions, 399 flow [2025-03-17 11:17:33,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=129, PETRI_TRANSITIONS=128} [2025-03-17 11:17:33,633 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 18 predicate places. [2025-03-17 11:17:33,633 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 399 flow [2025-03-17 11:17:33,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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-17 11:17:33,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:33,635 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] [2025-03-17 11:17:33,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:17:33,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:17:33,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:33,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1317507460, now seen corresponding path program 1 times [2025-03-17 11:17:33,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:33,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956413493] [2025-03-17 11:17:33,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:33,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:33,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:17:33,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:17:33,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:33,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:33,680 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-17 11:17:33,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:33,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956413493] [2025-03-17 11:17:33,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956413493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:33,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:33,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:17:33,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40021551] [2025-03-17 11:17:33,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:33,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:17:33,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:33,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:17:33,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:17:33,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 110 [2025-03-17 11:17:33,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 128 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-17 11:17:33,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:33,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 110 [2025-03-17 11:17:33,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:33,728 INFO L124 PetriNetUnfolderBase]: 30/261 cut-off events. [2025-03-17 11:17:33,728 INFO L125 PetriNetUnfolderBase]: For 33/44 co-relation queries the response was YES. [2025-03-17 11:17:33,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 261 events. 30/261 cut-off events. For 33/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 871 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 359. Up to 49 conditions per place. [2025-03-17 11:17:33,730 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 5 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2025-03-17 11:17:33,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 126 transitions, 409 flow [2025-03-17 11:17:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:17:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:17:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2025-03-17 11:17:33,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9363636363636364 [2025-03-17 11:17:33,731 INFO L175 Difference]: Start difference. First operand has 129 places, 128 transitions, 399 flow. Second operand 3 states and 309 transitions. [2025-03-17 11:17:33,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 126 transitions, 409 flow [2025-03-17 11:17:33,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 126 transitions, 395 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-17 11:17:33,735 INFO L231 Difference]: Finished difference. Result has 121 places, 126 transitions, 385 flow [2025-03-17 11:17:33,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=121, PETRI_TRANSITIONS=126} [2025-03-17 11:17:33,735 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places. [2025-03-17 11:17:33,736 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 385 flow [2025-03-17 11:17:33,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-17 11:17:33,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:33,736 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] [2025-03-17 11:17:33,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:17:33,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:17:33,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:33,738 INFO L85 PathProgramCache]: Analyzing trace with hash -857627191, now seen corresponding path program 1 times [2025-03-17 11:17:33,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532053097] [2025-03-17 11:17:33,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:33,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:33,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:17:33,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:17:33,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:33,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:33,782 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-17 11:17:33,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:33,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532053097] [2025-03-17 11:17:33,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532053097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:33,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:33,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:17:33,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744509963] [2025-03-17 11:17:33,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:33,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:17:33,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:33,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:17:33,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:17:33,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 110 [2025-03-17 11:17:33,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-17 11:17:33,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:33,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 110 [2025-03-17 11:17:33,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:33,837 INFO L124 PetriNetUnfolderBase]: 30/260 cut-off events. [2025-03-17 11:17:33,838 INFO L125 PetriNetUnfolderBase]: For 33/44 co-relation queries the response was YES. [2025-03-17 11:17:33,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 260 events. 30/260 cut-off events. For 33/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 859 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 358. Up to 49 conditions per place. [2025-03-17 11:17:33,840 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 6 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2025-03-17 11:17:33,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 125 transitions, 399 flow [2025-03-17 11:17:33,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:17:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:17:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2025-03-17 11:17:33,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9363636363636364 [2025-03-17 11:17:33,841 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 385 flow. Second operand 3 states and 309 transitions. [2025-03-17 11:17:33,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 125 transitions, 399 flow [2025-03-17 11:17:33,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 125 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:17:33,846 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 383 flow [2025-03-17 11:17:33,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2025-03-17 11:17:33,848 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2025-03-17 11:17:33,848 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 383 flow [2025-03-17 11:17:33,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-17 11:17:33,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:33,849 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] [2025-03-17 11:17:33,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:17:33,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:17:33,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:33,850 INFO L85 PathProgramCache]: Analyzing trace with hash -681352562, now seen corresponding path program 1 times [2025-03-17 11:17:33,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:33,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890890127] [2025-03-17 11:17:33,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:33,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:33,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:17:33,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:17:33,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:33,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:34,152 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-17 11:17:34,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:34,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890890127] [2025-03-17 11:17:34,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890890127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:34,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:34,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:17:34,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920678469] [2025-03-17 11:17:34,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:34,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:17:34,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:34,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:17:34,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:17:34,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2025-03-17 11:17:34,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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-17 11:17:34,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:34,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2025-03-17 11:17:34,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:34,348 INFO L124 PetriNetUnfolderBase]: 81/421 cut-off events. [2025-03-17 11:17:34,349 INFO L125 PetriNetUnfolderBase]: For 93/185 co-relation queries the response was YES. [2025-03-17 11:17:34,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 421 events. 81/421 cut-off events. For 93/185 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2043 event pairs, 15 based on Foata normal form. 16/407 useless extension candidates. Maximal degree in co-relation 768. Up to 173 conditions per place. [2025-03-17 11:17:34,352 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 38 selfloop transitions, 21 changer transitions 7/147 dead transitions. [2025-03-17 11:17:34,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 147 transitions, 588 flow [2025-03-17 11:17:34,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:17:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:17:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2025-03-17 11:17:34,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8590909090909091 [2025-03-17 11:17:34,354 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 383 flow. Second operand 6 states and 567 transitions. [2025-03-17 11:17:34,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 147 transitions, 588 flow [2025-03-17 11:17:34,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 147 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:17:34,359 INFO L231 Difference]: Finished difference. Result has 128 places, 140 transitions, 540 flow [2025-03-17 11:17:34,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=128, PETRI_TRANSITIONS=140} [2025-03-17 11:17:34,360 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 17 predicate places. [2025-03-17 11:17:34,360 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 140 transitions, 540 flow [2025-03-17 11:17:34,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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-17 11:17:34,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:34,360 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:17:34,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:17:34,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:17:34,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:34,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1122216858, now seen corresponding path program 1 times [2025-03-17 11:17:34,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:34,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562987625] [2025-03-17 11:17:34,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:34,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:17:34,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:17:34,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:34,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:17:34,383 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:17:34,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:17:34,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:17:34,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:34,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:17:34,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:17:34,413 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:17:34,414 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-17 11:17:34,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-17 11:17:34,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-17 11:17:34,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-17 11:17:34,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-17 11:17:34,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-17 11:17:34,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-03-17 11:17:34,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-17 11:17:34,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-17 11:17:34,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-17 11:17:34,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-17 11:17:34,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-17 11:17:34,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-17 11:17:34,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-17 11:17:34,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-17 11:17:34,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:17:34,417 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:17:34,418 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:17:34,418 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:17:34,437 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:17:34,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 146 transitions, 308 flow [2025-03-17 11:17:34,462 INFO L124 PetriNetUnfolderBase]: 4/247 cut-off events. [2025-03-17 11:17:34,462 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-17 11:17:34,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 247 events. 4/247 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 590 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 145. Up to 6 conditions per place. [2025-03-17 11:17:34,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 146 transitions, 308 flow [2025-03-17 11:17:34,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 146 transitions, 308 flow [2025-03-17 11:17:34,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:17:34,466 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;@3f3d47c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:17:34,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-17 11:17:34,468 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:17:34,469 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-03-17 11:17:34,469 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:17:34,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:34,469 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] [2025-03-17 11:17:34,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-17 11:17:34,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:34,469 INFO L85 PathProgramCache]: Analyzing trace with hash -834665620, now seen corresponding path program 1 times [2025-03-17 11:17:34,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:34,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964908270] [2025-03-17 11:17:34,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:34,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:34,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:17:34,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:17:34,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:34,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:34,488 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-17 11:17:34,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:34,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964908270] [2025-03-17 11:17:34,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964908270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:34,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:34,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:17:34,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728373212] [2025-03-17 11:17:34,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:34,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:17:34,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:34,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:17:34,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:17:34,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 146 [2025-03-17 11:17:34,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-17 11:17:34,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:34,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 146 [2025-03-17 11:17:34,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:34,555 INFO L124 PetriNetUnfolderBase]: 19/420 cut-off events. [2025-03-17 11:17:34,555 INFO L125 PetriNetUnfolderBase]: For 28/30 co-relation queries the response was YES. [2025-03-17 11:17:34,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 420 events. 19/420 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1725 event pairs, 16 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 291. Up to 50 conditions per place. [2025-03-17 11:17:34,559 INFO L140 encePairwiseOnDemand]: 142/146 looper letters, 11 selfloop transitions, 2 changer transitions 1/144 dead transitions. [2025-03-17 11:17:34,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 144 transitions, 330 flow [2025-03-17 11:17:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:17:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:17:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2025-03-17 11:17:34,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315068493150684 [2025-03-17 11:17:34,561 INFO L175 Difference]: Start difference. First operand has 148 places, 146 transitions, 308 flow. Second operand 3 states and 408 transitions. [2025-03-17 11:17:34,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 144 transitions, 330 flow [2025-03-17 11:17:34,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 330 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:17:34,563 INFO L231 Difference]: Finished difference. Result has 149 places, 143 transitions, 306 flow [2025-03-17 11:17:34,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2025-03-17 11:17:34,563 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 1 predicate places. [2025-03-17 11:17:34,564 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 306 flow [2025-03-17 11:17:34,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-17 11:17:34,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:34,564 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] [2025-03-17 11:17:34,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:17:34,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-17 11:17:34,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1420647833, now seen corresponding path program 1 times [2025-03-17 11:17:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:34,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238417688] [2025-03-17 11:17:34,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:34,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:17:34,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:17:34,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:34,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:34,590 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-17 11:17:34,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238417688] [2025-03-17 11:17:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238417688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:34,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:17:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792874730] [2025-03-17 11:17:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:34,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:17:34,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:34,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:17:34,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:17:34,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 146 [2025-03-17 11:17:34,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-17 11:17:34,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:34,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 146 [2025-03-17 11:17:34,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:34,663 INFO L124 PetriNetUnfolderBase]: 48/667 cut-off events. [2025-03-17 11:17:34,663 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-17 11:17:34,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 667 events. 48/667 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3481 event pairs, 27 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 760. Up to 97 conditions per place. [2025-03-17 11:17:34,667 INFO L140 encePairwiseOnDemand]: 140/146 looper letters, 12 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2025-03-17 11:17:34,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 343 flow [2025-03-17 11:17:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:17:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:17:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2025-03-17 11:17:34,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9383561643835616 [2025-03-17 11:17:34,669 INFO L175 Difference]: Start difference. First operand has 149 places, 143 transitions, 306 flow. Second operand 3 states and 411 transitions. [2025-03-17 11:17:34,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 343 flow [2025-03-17 11:17:34,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 144 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:17:34,671 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 317 flow [2025-03-17 11:17:34,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2025-03-17 11:17:34,672 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, -2 predicate places. [2025-03-17 11:17:34,672 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 317 flow [2025-03-17 11:17:34,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-17 11:17:34,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:34,672 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] [2025-03-17 11:17:34,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:17:34,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-17 11:17:34,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1396561649, now seen corresponding path program 1 times [2025-03-17 11:17:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:34,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478976276] [2025-03-17 11:17:34,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:34,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:34,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:17:34,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:17:34,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:34,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:34,861 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-17 11:17:34,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:34,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478976276] [2025-03-17 11:17:34,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478976276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:34,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:34,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:17:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125792927] [2025-03-17 11:17:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:34,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:17:34,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:34,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:17:34,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:17:34,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 146 [2025-03-17 11:17:34,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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-17 11:17:34,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:34,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 146 [2025-03-17 11:17:34,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:35,370 INFO L124 PetriNetUnfolderBase]: 1014/3225 cut-off events. [2025-03-17 11:17:35,370 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-17 11:17:35,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5114 conditions, 3225 events. 1014/3225 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 25915 event pairs, 586 based on Foata normal form. 0/2825 useless extension candidates. Maximal degree in co-relation 4166. Up to 1589 conditions per place. [2025-03-17 11:17:35,389 INFO L140 encePairwiseOnDemand]: 131/146 looper letters, 30 selfloop transitions, 38 changer transitions 0/181 dead transitions. [2025-03-17 11:17:35,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 181 transitions, 534 flow [2025-03-17 11:17:35,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:17:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:17:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2025-03-17 11:17:35,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8664383561643836 [2025-03-17 11:17:35,391 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 317 flow. Second operand 6 states and 759 transitions. [2025-03-17 11:17:35,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 181 transitions, 534 flow [2025-03-17 11:17:35,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 181 transitions, 534 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:17:35,394 INFO L231 Difference]: Finished difference. Result has 156 places, 180 transitions, 571 flow [2025-03-17 11:17:35,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=156, PETRI_TRANSITIONS=180} [2025-03-17 11:17:35,395 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 8 predicate places. [2025-03-17 11:17:35,395 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 180 transitions, 571 flow [2025-03-17 11:17:35,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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-17 11:17:35,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:35,395 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] [2025-03-17 11:17:35,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:17:35,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-17 11:17:35,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:35,396 INFO L85 PathProgramCache]: Analyzing trace with hash 175043654, now seen corresponding path program 1 times [2025-03-17 11:17:35,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:35,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639785506] [2025-03-17 11:17:35,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:35,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:35,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:17:35,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:17:35,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:35,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:35,445 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-17 11:17:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:35,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639785506] [2025-03-17 11:17:35,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639785506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:35,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:35,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:17:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931079616] [2025-03-17 11:17:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:35,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:17:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:35,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:17:35,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:17:35,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 146 [2025-03-17 11:17:35,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 180 transitions, 571 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:17:35,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:35,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 146 [2025-03-17 11:17:35,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:35,658 INFO L124 PetriNetUnfolderBase]: 430/1796 cut-off events. [2025-03-17 11:17:35,658 INFO L125 PetriNetUnfolderBase]: For 346/573 co-relation queries the response was YES. [2025-03-17 11:17:35,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3224 conditions, 1796 events. 430/1796 cut-off events. For 346/573 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 12713 event pairs, 135 based on Foata normal form. 2/1648 useless extension candidates. Maximal degree in co-relation 2661. Up to 612 conditions per place. [2025-03-17 11:17:35,697 INFO L140 encePairwiseOnDemand]: 138/146 looper letters, 14 selfloop transitions, 2 changer transitions 5/186 dead transitions. [2025-03-17 11:17:35,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 186 transitions, 625 flow [2025-03-17 11:17:35,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:17:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:17:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 802 transitions. [2025-03-17 11:17:35,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9155251141552512 [2025-03-17 11:17:35,700 INFO L175 Difference]: Start difference. First operand has 156 places, 180 transitions, 571 flow. Second operand 6 states and 802 transitions. [2025-03-17 11:17:35,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 186 transitions, 625 flow [2025-03-17 11:17:35,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 186 transitions, 625 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:17:35,705 INFO L231 Difference]: Finished difference. Result has 165 places, 181 transitions, 593 flow [2025-03-17 11:17:35,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=165, PETRI_TRANSITIONS=181} [2025-03-17 11:17:35,705 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 17 predicate places. [2025-03-17 11:17:35,705 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 181 transitions, 593 flow [2025-03-17 11:17:35,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:17:35,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:35,706 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] [2025-03-17 11:17:35,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:17:35,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-17 11:17:35,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash 596905958, now seen corresponding path program 1 times [2025-03-17 11:17:35,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:35,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623631103] [2025-03-17 11:17:35,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:35,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:35,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:17:35,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:17:35,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:35,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:35,734 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-17 11:17:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:35,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623631103] [2025-03-17 11:17:35,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623631103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:35,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:35,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:17:35,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139272584] [2025-03-17 11:17:35,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:35,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:17:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:35,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:17:35,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:17:35,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 146 [2025-03-17 11:17:35,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 181 transitions, 593 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-17 11:17:35,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:35,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 146 [2025-03-17 11:17:35,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:36,042 INFO L124 PetriNetUnfolderBase]: 698/3501 cut-off events. [2025-03-17 11:17:36,042 INFO L125 PetriNetUnfolderBase]: For 681/878 co-relation queries the response was YES. [2025-03-17 11:17:36,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6264 conditions, 3501 events. 698/3501 cut-off events. For 681/878 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 33292 event pairs, 150 based on Foata normal form. 0/3243 useless extension candidates. Maximal degree in co-relation 6172. Up to 1046 conditions per place. [2025-03-17 11:17:36,071 INFO L140 encePairwiseOnDemand]: 132/146 looper letters, 21 selfloop transitions, 10 changer transitions 0/194 dead transitions. [2025-03-17 11:17:36,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 194 transitions, 692 flow [2025-03-17 11:17:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:17:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:17:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2025-03-17 11:17:36,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497716894977168 [2025-03-17 11:17:36,073 INFO L175 Difference]: Start difference. First operand has 165 places, 181 transitions, 593 flow. Second operand 3 states and 416 transitions. [2025-03-17 11:17:36,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 194 transitions, 692 flow [2025-03-17 11:17:36,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 194 transitions, 680 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-17 11:17:36,086 INFO L231 Difference]: Finished difference. Result has 162 places, 191 transitions, 669 flow [2025-03-17 11:17:36,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=162, PETRI_TRANSITIONS=191} [2025-03-17 11:17:36,087 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 14 predicate places. [2025-03-17 11:17:36,088 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 191 transitions, 669 flow [2025-03-17 11:17:36,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-17 11:17:36,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:36,088 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] [2025-03-17 11:17:36,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:17:36,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-17 11:17:36,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1309832405, now seen corresponding path program 1 times [2025-03-17 11:17:36,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:36,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761379063] [2025-03-17 11:17:36,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:36,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:36,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:17:36,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:17:36,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:36,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:36,122 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-17 11:17:36,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:36,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761379063] [2025-03-17 11:17:36,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761379063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:36,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:36,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:17:36,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014923554] [2025-03-17 11:17:36,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:36,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:17:36,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:36,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:17:36,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:17:36,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 146 [2025-03-17 11:17:36,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 191 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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-17 11:17:36,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:36,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 146 [2025-03-17 11:17:36,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:36,527 INFO L124 PetriNetUnfolderBase]: 789/4006 cut-off events. [2025-03-17 11:17:36,527 INFO L125 PetriNetUnfolderBase]: For 914/1109 co-relation queries the response was YES. [2025-03-17 11:17:36,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7258 conditions, 4006 events. 789/4006 cut-off events. For 914/1109 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 39473 event pairs, 164 based on Foata normal form. 5/3717 useless extension candidates. Maximal degree in co-relation 6283. Up to 1186 conditions per place. [2025-03-17 11:17:36,561 INFO L140 encePairwiseOnDemand]: 139/146 looper letters, 20 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2025-03-17 11:17:36,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 200 transitions, 769 flow [2025-03-17 11:17:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:17:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:17:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2025-03-17 11:17:36,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2025-03-17 11:17:36,562 INFO L175 Difference]: Start difference. First operand has 162 places, 191 transitions, 669 flow. Second operand 3 states and 415 transitions. [2025-03-17 11:17:36,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 200 transitions, 769 flow [2025-03-17 11:17:36,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 200 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:17:36,572 INFO L231 Difference]: Finished difference. Result has 164 places, 198 transitions, 725 flow [2025-03-17 11:17:36,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=164, PETRI_TRANSITIONS=198} [2025-03-17 11:17:36,573 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 16 predicate places. [2025-03-17 11:17:36,573 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 198 transitions, 725 flow [2025-03-17 11:17:36,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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-17 11:17:36,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:36,573 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] [2025-03-17 11:17:36,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:17:36,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-17 11:17:36,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash -543270032, now seen corresponding path program 1 times [2025-03-17 11:17:36,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:36,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450611639] [2025-03-17 11:17:36,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:36,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:36,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:17:36,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:17:36,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:36,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:36,792 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-17 11:17:36,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:36,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450611639] [2025-03-17 11:17:36,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450611639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:36,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:36,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:17:36,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415010888] [2025-03-17 11:17:36,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:36,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:17:36,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:36,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:17:36,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:17:36,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 146 [2025-03-17 11:17:36,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 198 transitions, 725 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:17:36,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:36,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 146 [2025-03-17 11:17:36,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:37,649 INFO L124 PetriNetUnfolderBase]: 2240/7604 cut-off events. [2025-03-17 11:17:37,650 INFO L125 PetriNetUnfolderBase]: For 2392/7786 co-relation queries the response was YES. [2025-03-17 11:17:37,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16472 conditions, 7604 events. 2240/7604 cut-off events. For 2392/7786 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 78318 event pairs, 601 based on Foata normal form. 241/7172 useless extension candidates. Maximal degree in co-relation 14254. Up to 3713 conditions per place. [2025-03-17 11:17:37,696 INFO L140 encePairwiseOnDemand]: 131/146 looper letters, 64 selfloop transitions, 38 changer transitions 0/237 dead transitions. [2025-03-17 11:17:37,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 237 transitions, 1077 flow [2025-03-17 11:17:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:17:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:17:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2025-03-17 11:17:37,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8789954337899544 [2025-03-17 11:17:37,699 INFO L175 Difference]: Start difference. First operand has 164 places, 198 transitions, 725 flow. Second operand 6 states and 770 transitions. [2025-03-17 11:17:37,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 237 transitions, 1077 flow [2025-03-17 11:17:37,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 237 transitions, 1059 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:17:37,710 INFO L231 Difference]: Finished difference. Result has 172 places, 235 transitions, 1025 flow [2025-03-17 11:17:37,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1025, PETRI_PLACES=172, PETRI_TRANSITIONS=235} [2025-03-17 11:17:37,711 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 24 predicate places. [2025-03-17 11:17:37,711 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 235 transitions, 1025 flow [2025-03-17 11:17:37,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:17:37,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:37,712 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-17 11:17:37,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:17:37,712 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-17 11:17:37,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash -979991911, now seen corresponding path program 1 times [2025-03-17 11:17:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:37,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123197010] [2025-03-17 11:17:37,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:37,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 11:17:37,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 11:17:37,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:37,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:37,925 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-17 11:17:37,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:37,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123197010] [2025-03-17 11:17:37,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123197010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:37,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:37,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:17:37,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480365431] [2025-03-17 11:17:37,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:37,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:17:37,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:37,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:17:37,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:17:38,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 146 [2025-03-17 11:17:38,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 235 transitions, 1025 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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-17 11:17:38,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:38,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 146 [2025-03-17 11:17:38,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:39,533 INFO L124 PetriNetUnfolderBase]: 5040/15296 cut-off events. [2025-03-17 11:17:39,534 INFO L125 PetriNetUnfolderBase]: For 9440/22601 co-relation queries the response was YES. [2025-03-17 11:17:39,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39409 conditions, 15296 events. 5040/15296 cut-off events. For 9440/22601 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 161859 event pairs, 842 based on Foata normal form. 40/14200 useless extension candidates. Maximal degree in co-relation 35415. Up to 6569 conditions per place. [2025-03-17 11:17:39,645 INFO L140 encePairwiseOnDemand]: 127/146 looper letters, 127 selfloop transitions, 118 changer transitions 0/382 dead transitions. [2025-03-17 11:17:39,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 382 transitions, 2373 flow [2025-03-17 11:17:39,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:17:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:17:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 804 transitions. [2025-03-17 11:17:39,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178082191780822 [2025-03-17 11:17:39,647 INFO L175 Difference]: Start difference. First operand has 172 places, 235 transitions, 1025 flow. Second operand 6 states and 804 transitions. [2025-03-17 11:17:39,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 382 transitions, 2373 flow [2025-03-17 11:17:39,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 382 transitions, 2241 flow, removed 66 selfloop flow, removed 0 redundant places. [2025-03-17 11:17:39,693 INFO L231 Difference]: Finished difference. Result has 181 places, 347 transitions, 2091 flow [2025-03-17 11:17:39,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2091, PETRI_PLACES=181, PETRI_TRANSITIONS=347} [2025-03-17 11:17:39,694 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 33 predicate places. [2025-03-17 11:17:39,694 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 347 transitions, 2091 flow [2025-03-17 11:17:39,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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-17 11:17:39,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:39,695 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:17:39,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:17:39,695 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-17 11:17:39,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash 929220674, now seen corresponding path program 1 times [2025-03-17 11:17:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:39,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854881560] [2025-03-17 11:17:39,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:39,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:39,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 11:17:39,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 11:17:39,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:39,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:39,728 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-17 11:17:39,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:39,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854881560] [2025-03-17 11:17:39,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854881560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:39,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:39,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:17:39,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112189990] [2025-03-17 11:17:39,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:39,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:17:39,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:39,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:17:39,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:17:39,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 146 [2025-03-17 11:17:39,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 347 transitions, 2091 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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-17 11:17:39,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:39,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 146 [2025-03-17 11:17:39,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:40,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] threadEXIT-->L1061: Formula: (= v_threadThread1of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem15#1_8|) InVars {threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} AuxVars[] AssignedVars[][258], [201#true, 42#L1048-3true, Black: 194#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 190#true, Black: 192#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 205#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 158#true, Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 211#true, Black: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 156#(= |#race~datas~0| 0), Black: 154#true, Black: 161#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 162#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 160#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 163#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 122#L1061true, 149#true, Black: 171#(= |ULTIMATE.start_main_~i~0#1| 0), 146#true, 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 180#true, Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2025-03-17 11:17:40,578 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-17 11:17:40,578 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-17 11:17:40,578 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-17 11:17:40,578 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-17 11:17:40,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] threadEXIT-->L1061: Formula: (= v_threadThread1of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem15#1_8|) InVars {threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} AuxVars[] AssignedVars[][298], [201#true, Black: 194#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 190#true, Black: 192#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), 213#(= |threadThread2of2ForFork0_#t~nondet4| |#race~next_j~0|), Black: 205#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 158#true, Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 156#(= |#race~datas~0| 0), Black: 154#true, Black: 161#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 162#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 160#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 163#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 122#L1061true, 149#true, Black: 171#(= |ULTIMATE.start_main_~i~0#1| 0), 146#true, 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 182#(= |#race~next_j~0| 0), 93#L1048-2true, Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2025-03-17 11:17:40,608 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-03-17 11:17:40,608 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-17 11:17:40,608 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-17 11:17:40,608 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-17 11:17:41,042 INFO L124 PetriNetUnfolderBase]: 3859/13167 cut-off events. [2025-03-17 11:17:41,042 INFO L125 PetriNetUnfolderBase]: For 10080/11308 co-relation queries the response was YES. [2025-03-17 11:17:41,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36212 conditions, 13167 events. 3859/13167 cut-off events. For 10080/11308 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 144796 event pairs, 314 based on Foata normal form. 11/12572 useless extension candidates. Maximal degree in co-relation 32317. Up to 3165 conditions per place. [2025-03-17 11:17:41,122 INFO L140 encePairwiseOnDemand]: 139/146 looper letters, 22 selfloop transitions, 11 changer transitions 0/355 dead transitions. [2025-03-17 11:17:41,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 355 transitions, 2190 flow [2025-03-17 11:17:41,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:17:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:17:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2025-03-17 11:17:41,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9452054794520548 [2025-03-17 11:17:41,124 INFO L175 Difference]: Start difference. First operand has 181 places, 347 transitions, 2091 flow. Second operand 3 states and 414 transitions. [2025-03-17 11:17:41,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 355 transitions, 2190 flow [2025-03-17 11:17:41,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 355 transitions, 2154 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-17 11:17:41,274 INFO L231 Difference]: Finished difference. Result has 185 places, 354 transitions, 2143 flow [2025-03-17 11:17:41,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=185, PETRI_TRANSITIONS=354} [2025-03-17 11:17:41,275 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 37 predicate places. [2025-03-17 11:17:41,276 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 354 transitions, 2143 flow [2025-03-17 11:17:41,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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-17 11:17:41,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:41,276 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:17:41,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:17:41,276 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-17 11:17:41,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash 903400179, now seen corresponding path program 1 times [2025-03-17 11:17:41,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:41,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979825583] [2025-03-17 11:17:41,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:41,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:41,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 11:17:41,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 11:17:41,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:41,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:17:41,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:17:41,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 11:17:41,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 11:17:41,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:41,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:17:41,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:17:41,311 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:17:41,311 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr4ASSERT_VIOLATIONDATA_RACE (19 of 20 remaining) [2025-03-17 11:17:41,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-17 11:17:41,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-17 11:17:41,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-17 11:17:41,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-17 11:17:41,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 20 remaining) [2025-03-17 11:17:41,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-17 11:17:41,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-17 11:17:41,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-17 11:17:41,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-17 11:17:41,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-03-17 11:17:41,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-03-17 11:17:41,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-17 11:17:41,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-17 11:17:41,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-17 11:17:41,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-17 11:17:41,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-17 11:17:41,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-17 11:17:41,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-17 11:17:41,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-17 11:17:41,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:17:41,313 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:17:41,359 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-03-17 11:17:41,360 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:17:41,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:17:41 BasicIcfg [2025-03-17 11:17:41,365 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:17:41,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:17:41,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:17:41,365 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:17:41,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:17:31" (3/4) ... [2025-03-17 11:17:41,367 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 11:17:41,417 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-03-17 11:17:41,451 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:17:41,451 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:17:41,451 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:17:41,452 INFO L158 Benchmark]: Toolchain (without parser) took 10348.64ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 111.7MB in the beginning and 382.5MB in the end (delta: -270.8MB). Peak memory consumption was 434.0MB. Max. memory is 16.1GB. [2025-03-17 11:17:41,454 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:17:41,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.80ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 83.5MB in the end (delta: 28.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 11:17:41,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.59ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:17:41,455 INFO L158 Benchmark]: Boogie Preprocessor took 28.46ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 80.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:17:41,455 INFO L158 Benchmark]: IcfgBuilder took 329.35ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 63.2MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:17:41,455 INFO L158 Benchmark]: TraceAbstraction took 9363.35ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 62.8MB in the beginning and 399.3MB in the end (delta: -336.6MB). Peak memory consumption was 366.9MB. Max. memory is 16.1GB. [2025-03-17 11:17:41,456 INFO L158 Benchmark]: Witness Printer took 86.23ms. Allocated memory is still 847.2MB. Free memory was 399.3MB in the beginning and 382.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:17:41,456 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.80ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 83.5MB in the end (delta: 28.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.59ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.46ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 80.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 329.35ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 63.2MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9363.35ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 62.8MB in the beginning and 399.3MB in the end (delta: -336.6MB). Peak memory consumption was 366.9MB. Max. memory is 16.1GB. * Witness Printer took 86.23ms. Allocated memory is still 847.2MB. Free memory was 399.3MB in the beginning and 382.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1047]: Data race detected Data race detected The following path leads to a data race: [L1043] 0 int *datas; VAL [datas={0:0}] [L1044] 0 int next_j = 0; VAL [datas={0:0}, next_j=0] [L1053] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, next_j=0, threads_total=2] [L1054] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, next_j=0] [L1054] RET 0 assume_abort_if_not(threads_total >= 0) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, next_j=0, threads_total=2, tids={-2:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={-3:0}, next_j=0, threads_total=2, tids={-2:0}] [L1057] 0 int i = 0; VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={-3:0}, next_j=0] [L1058] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1058] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1046] 1 int j; VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1057] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1058] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1058] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1047] 1 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1046] 2 int j; VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1047] 2 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=0] [L1048] 1 next_j++ VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=1] [L1047] 2 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=1] Now there is a data race on ~next_j~0 between C: next_j++ [1048] and C: j = next_j [1047] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 144 locations, 146 edges, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 506 IncrementalHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 29 mSDtfsCounter, 506 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 179 locations, 182 edges, 20 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.9s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 512 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 962 IncrementalHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 59 mSDtfsCounter, 962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2143occurred in iteration=9, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-17 11:17:41,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)