./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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/goblint-regression/02-base_25-malloc_race_cp.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 1bf1a57452cb04c4e0acc7059a368e9894233cf719b7dca68f11bd8477a0c6ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:34:32,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:34:32,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:34:32,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:34:32,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:34:32,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:34:32,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:34:32,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:34:32,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:34:32,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:34:32,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:34:32,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:34:32,607 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:34:32,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:34:32,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:34:32,607 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:34:32,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:34:32,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:34:32,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:34:32,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:34:32,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:34:32,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:34:32,608 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:34:32,608 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:34:32,608 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:34:32,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:34:32,608 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:34:32,608 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:34:32,608 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:34:32,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:34:32,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:34:32,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:34:32,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:34:32,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:34:32,609 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:34:32,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:34:32,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:34:32,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:34:32,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:34:32,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:34:32,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:34:32,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:34:32,610 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 -> 1bf1a57452cb04c4e0acc7059a368e9894233cf719b7dca68f11bd8477a0c6ed [2025-03-14 01:34:32,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:34:32,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:34:32,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:34:32,851 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:34:32,851 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:34:32,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i [2025-03-14 01:34:34,023 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be8a3c92/5aa24b8ffaac42bcac4711841d8c4f79/FLAGf8df96482 [2025-03-14 01:34:34,309 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:34:34,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i [2025-03-14 01:34:34,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be8a3c92/5aa24b8ffaac42bcac4711841d8c4f79/FLAGf8df96482 [2025-03-14 01:34:34,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be8a3c92/5aa24b8ffaac42bcac4711841d8c4f79 [2025-03-14 01:34:34,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:34:34,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:34:34,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:34:34,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:34:34,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:34:34,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74086e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34, skipping insertion in model container [2025-03-14 01:34:34,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:34:34,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:34:34,782 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:34:34,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:34:34,905 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:34:34,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34 WrapperNode [2025-03-14 01:34:34,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:34:34,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:34:34,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:34:34,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:34:34,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,944 INFO L138 Inliner]: procedures = 365, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2025-03-14 01:34:34,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:34:34,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:34:34,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:34:34,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:34:34,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:34:34,963 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:34:34,963 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:34:34,963 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:34:34,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34" (1/1) ... [2025-03-14 01:34:34,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:34:34,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:34:34,998 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-14 01:34:35,000 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-14 01:34:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:34:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:34:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:34:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:34:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:34:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:34:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:34:35,023 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:34:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:34:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:34:35,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:34:35,025 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:34:35,152 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:34:35,155 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:34:35,355 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:34:35,358 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:34:35,358 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:34:35,378 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:34:35,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:34:35 BoogieIcfgContainer [2025-03-14 01:34:35,379 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:34:35,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:34:35,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:34:35,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:34:35,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:34:34" (1/3) ... [2025-03-14 01:34:35,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a63abba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:34:35, skipping insertion in model container [2025-03-14 01:34:35,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:34:34" (2/3) ... [2025-03-14 01:34:35,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a63abba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:34:35, skipping insertion in model container [2025-03-14 01:34:35,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:34:35" (3/3) ... [2025-03-14 01:34:35,387 INFO L128 eAbstractionObserver]: Analyzing ICFG 02-base_25-malloc_race_cp.i [2025-03-14 01:34:35,400 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:34:35,402 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02-base_25-malloc_race_cp.i that has 2 procedures, 105 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-14 01:34:35,402 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:34:35,458 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:34:35,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 212 flow [2025-03-14 01:34:35,527 INFO L124 PetriNetUnfolderBase]: 0/103 cut-off events. [2025-03-14 01:34:35,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:34:35,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 103 events. 0/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-14 01:34:35,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 104 transitions, 212 flow [2025-03-14 01:34:35,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 103 transitions, 209 flow [2025-03-14 01:34:35,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:34:35,559 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;@2aacfe68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:34:35,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-14 01:34:35,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:34:35,570 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-14 01:34:35,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:34:35,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:35,570 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] [2025-03-14 01:34:35,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:35,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:35,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1124581080, now seen corresponding path program 1 times [2025-03-14 01:34:35,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:35,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407016147] [2025-03-14 01:34:35,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:35,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:35,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 01:34:35,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:34:35,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:35,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:35,759 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-14 01:34:35,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:35,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407016147] [2025-03-14 01:34:35,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407016147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:35,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:35,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:34:35,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036666929] [2025-03-14 01:34:35,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:35,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:34:35,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:35,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:34:35,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:34:35,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2025-03-14 01:34:35,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-14 01:34:35,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:35,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2025-03-14 01:34:35,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:35,909 INFO L124 PetriNetUnfolderBase]: 12/234 cut-off events. [2025-03-14 01:34:35,910 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:34:35,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 234 events. 12/234 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 673 event pairs, 12 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 227. Up to 36 conditions per place. [2025-03-14 01:34:35,914 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 11 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2025-03-14 01:34:35,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 102 transitions, 233 flow [2025-03-14 01:34:35,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:34:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:34:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-14 01:34:35,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2025-03-14 01:34:35,927 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 209 flow. Second operand 3 states and 284 transitions. [2025-03-14 01:34:35,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 102 transitions, 233 flow [2025-03-14 01:34:35,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:34:35,934 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 210 flow [2025-03-14 01:34:35,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2025-03-14 01:34:35,938 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 0 predicate places. [2025-03-14 01:34:35,938 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 210 flow [2025-03-14 01:34:35,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-14 01:34:35,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:35,938 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] [2025-03-14 01:34:35,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:34:35,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:35,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1115737132, now seen corresponding path program 1 times [2025-03-14 01:34:35,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:35,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191092634] [2025-03-14 01:34:35,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:35,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:35,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:34:35,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:34:35,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:35,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:35,997 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-14 01:34:35,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:35,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191092634] [2025-03-14 01:34:35,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191092634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:35,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:35,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:34:35,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614420095] [2025-03-14 01:34:35,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:35,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:34:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:35,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:34:35,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:34:36,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2025-03-14 01:34:36,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-14 01:34:36,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:36,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2025-03-14 01:34:36,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:36,053 INFO L124 PetriNetUnfolderBase]: 9/200 cut-off events. [2025-03-14 01:34:36,053 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:34:36,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 200 events. 9/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 521 event pairs, 9 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 210. Up to 30 conditions per place. [2025-03-14 01:34:36,054 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 11 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-14 01:34:36,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 101 transitions, 234 flow [2025-03-14 01:34:36,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:34:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:34:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-14 01:34:36,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2025-03-14 01:34:36,056 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 210 flow. Second operand 3 states and 284 transitions. [2025-03-14 01:34:36,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 101 transitions, 234 flow [2025-03-14 01:34:36,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 101 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:34:36,058 INFO L231 Difference]: Finished difference. Result has 106 places, 101 transitions, 208 flow [2025-03-14 01:34:36,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=106, PETRI_TRANSITIONS=101} [2025-03-14 01:34:36,059 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -1 predicate places. [2025-03-14 01:34:36,059 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 101 transitions, 208 flow [2025-03-14 01:34:36,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-14 01:34:36,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:36,059 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] [2025-03-14 01:34:36,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:34:36,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:36,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:36,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1064404092, now seen corresponding path program 1 times [2025-03-14 01:34:36,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:36,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669107505] [2025-03-14 01:34:36,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:36,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:36,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:34:36,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:34:36,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:36,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:36,102 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-14 01:34:36,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669107505] [2025-03-14 01:34:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669107505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:36,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:36,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:34:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241031072] [2025-03-14 01:34:36,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:36,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:34:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:36,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:34:36,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:34:36,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 104 [2025-03-14 01:34:36,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 101 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:36,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:36,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 104 [2025-03-14 01:34:36,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:36,139 INFO L124 PetriNetUnfolderBase]: 8/165 cut-off events. [2025-03-14 01:34:36,140 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:34:36,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 165 events. 8/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 409 event pairs, 8 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 163. Up to 25 conditions per place. [2025-03-14 01:34:36,141 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 9 selfloop transitions, 1 changer transitions 0/99 dead transitions. [2025-03-14 01:34:36,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 224 flow [2025-03-14 01:34:36,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:34:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:34:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2025-03-14 01:34:36,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-03-14 01:34:36,142 INFO L175 Difference]: Start difference. First operand has 106 places, 101 transitions, 208 flow. Second operand 3 states and 288 transitions. [2025-03-14 01:34:36,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 224 flow [2025-03-14 01:34:36,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:34:36,144 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 202 flow [2025-03-14 01:34:36,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2025-03-14 01:34:36,145 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -3 predicate places. [2025-03-14 01:34:36,145 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 202 flow [2025-03-14 01:34:36,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:36,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:36,145 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] [2025-03-14 01:34:36,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:34:36,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:36,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:36,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1481655662, now seen corresponding path program 1 times [2025-03-14 01:34:36,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:36,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677246637] [2025-03-14 01:34:36,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:36,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:36,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-14 01:34:36,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-14 01:34:36,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:36,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:36,198 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-14 01:34:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:36,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677246637] [2025-03-14 01:34:36,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677246637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:36,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:36,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:34:36,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826844776] [2025-03-14 01:34:36,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:36,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:34:36,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:36,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:34:36,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:34:36,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 104 [2025-03-14 01:34:36,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:36,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:36,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 104 [2025-03-14 01:34:36,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:36,263 INFO L124 PetriNetUnfolderBase]: 16/249 cut-off events. [2025-03-14 01:34:36,263 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:34:36,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 249 events. 16/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 822 event pairs, 7 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 262. Up to 36 conditions per place. [2025-03-14 01:34:36,267 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 12 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-14 01:34:36,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 234 flow [2025-03-14 01:34:36,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:34:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:34:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-03-14 01:34:36,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358974358974359 [2025-03-14 01:34:36,269 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 202 flow. Second operand 3 states and 292 transitions. [2025-03-14 01:34:36,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 234 flow [2025-03-14 01:34:36,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 101 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:34:36,271 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 211 flow [2025-03-14 01:34:36,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2025-03-14 01:34:36,274 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -3 predicate places. [2025-03-14 01:34:36,274 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 211 flow [2025-03-14 01:34:36,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:36,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:36,274 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] [2025-03-14 01:34:36,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:34:36,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:36,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:36,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2116502456, now seen corresponding path program 1 times [2025-03-14 01:34:36,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:36,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011362857] [2025-03-14 01:34:36,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:36,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:36,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-14 01:34:36,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-14 01:34:36,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:36,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:36,709 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-14 01:34:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:36,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011362857] [2025-03-14 01:34:36,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011362857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:36,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:36,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:34:36,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024395323] [2025-03-14 01:34:36,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:36,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:34:36,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:36,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:34:36,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:34:36,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 104 [2025-03-14 01:34:36,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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-14 01:34:36,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:36,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 104 [2025-03-14 01:34:36,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:37,028 INFO L124 PetriNetUnfolderBase]: 231/839 cut-off events. [2025-03-14 01:34:37,028 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:34:37,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 839 events. 231/839 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4764 event pairs, 96 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1321. Up to 348 conditions per place. [2025-03-14 01:34:37,032 INFO L140 encePairwiseOnDemand]: 88/104 looper letters, 51 selfloop transitions, 41 changer transitions 0/163 dead transitions. [2025-03-14 01:34:37,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 163 transitions, 523 flow [2025-03-14 01:34:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:34:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:34:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 549 transitions. [2025-03-14 01:34:37,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8798076923076923 [2025-03-14 01:34:37,033 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 211 flow. Second operand 6 states and 549 transitions. [2025-03-14 01:34:37,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 163 transitions, 523 flow [2025-03-14 01:34:37,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 163 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:34:37,037 INFO L231 Difference]: Finished difference. Result has 113 places, 141 transitions, 469 flow [2025-03-14 01:34:37,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=469, PETRI_PLACES=113, PETRI_TRANSITIONS=141} [2025-03-14 01:34:37,037 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places. [2025-03-14 01:34:37,037 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 141 transitions, 469 flow [2025-03-14 01:34:37,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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-14 01:34:37,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:37,038 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] [2025-03-14 01:34:37,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:34:37,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:37,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:37,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1122203880, now seen corresponding path program 1 times [2025-03-14 01:34:37,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:37,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27312764] [2025-03-14 01:34:37,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:37,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:37,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:34:37,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:34:37,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:37,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:37,259 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-14 01:34:37,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:37,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27312764] [2025-03-14 01:34:37,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27312764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:37,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:37,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:34:37,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479082658] [2025-03-14 01:34:37,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:37,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:34:37,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:37,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:34:37,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:34:37,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 104 [2025-03-14 01:34:37,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 141 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 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-14 01:34:37,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:37,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 104 [2025-03-14 01:34:37,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:37,585 INFO L124 PetriNetUnfolderBase]: 285/1134 cut-off events. [2025-03-14 01:34:37,585 INFO L125 PetriNetUnfolderBase]: For 318/367 co-relation queries the response was YES. [2025-03-14 01:34:37,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 1134 events. 285/1134 cut-off events. For 318/367 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7596 event pairs, 29 based on Foata normal form. 31/1130 useless extension candidates. Maximal degree in co-relation 2361. Up to 272 conditions per place. [2025-03-14 01:34:37,591 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 71 selfloop transitions, 48 changer transitions 0/216 dead transitions. [2025-03-14 01:34:37,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 216 transitions, 971 flow [2025-03-14 01:34:37,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:34:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:34:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 579 transitions. [2025-03-14 01:34:37,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278846153846154 [2025-03-14 01:34:37,594 INFO L175 Difference]: Start difference. First operand has 113 places, 141 transitions, 469 flow. Second operand 6 states and 579 transitions. [2025-03-14 01:34:37,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 216 transitions, 971 flow [2025-03-14 01:34:37,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 216 transitions, 971 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:34:37,599 INFO L231 Difference]: Finished difference. Result has 123 places, 187 transitions, 875 flow [2025-03-14 01:34:37,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=875, PETRI_PLACES=123, PETRI_TRANSITIONS=187} [2025-03-14 01:34:37,599 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 16 predicate places. [2025-03-14 01:34:37,600 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 187 transitions, 875 flow [2025-03-14 01:34:37,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 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-14 01:34:37,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:37,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:37,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:34:37,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:37,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:37,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1042648452, now seen corresponding path program 1 times [2025-03-14 01:34:37,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:37,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207587545] [2025-03-14 01:34:37,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:37,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:34:37,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:34:37,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:37,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:37,668 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-14 01:34:37,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:37,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207587545] [2025-03-14 01:34:37,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207587545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:37,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:37,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:34:37,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15315013] [2025-03-14 01:34:37,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:37,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:34:37,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:37,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:34:37,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:34:37,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 104 [2025-03-14 01:34:37,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 187 transitions, 875 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-14 01:34:37,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:37,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 104 [2025-03-14 01:34:37,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:37,708 INFO L124 PetriNetUnfolderBase]: 39/286 cut-off events. [2025-03-14 01:34:37,708 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-14 01:34:37,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 286 events. 39/286 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 968 event pairs, 4 based on Foata normal form. 2/275 useless extension candidates. Maximal degree in co-relation 499. Up to 64 conditions per place. [2025-03-14 01:34:37,709 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 2 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-03-14 01:34:37,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 413 flow [2025-03-14 01:34:37,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:34:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:34:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2025-03-14 01:34:37,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967948717948718 [2025-03-14 01:34:37,711 INFO L175 Difference]: Start difference. First operand has 123 places, 187 transitions, 875 flow. Second operand 3 states and 302 transitions. [2025-03-14 01:34:37,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 413 flow [2025-03-14 01:34:37,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 120 transitions, 363 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-03-14 01:34:37,714 INFO L231 Difference]: Finished difference. Result has 116 places, 120 transitions, 359 flow [2025-03-14 01:34:37,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=359, PETRI_PLACES=116, PETRI_TRANSITIONS=120} [2025-03-14 01:34:37,714 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 9 predicate places. [2025-03-14 01:34:37,715 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 120 transitions, 359 flow [2025-03-14 01:34:37,715 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-14 01:34:37,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:37,715 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] [2025-03-14 01:34:37,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:34:37,715 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:37,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash -167339330, now seen corresponding path program 1 times [2025-03-14 01:34:37,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:37,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9848731] [2025-03-14 01:34:37,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:37,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:37,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:34:37,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:34:37,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:37,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:37,975 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-14 01:34:37,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:37,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9848731] [2025-03-14 01:34:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9848731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:37,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:34:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562102371] [2025-03-14 01:34:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:37,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:34:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:37,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:34:37,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:34:38,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 104 [2025-03-14 01:34:38,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 120 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 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-14 01:34:38,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:38,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 104 [2025-03-14 01:34:38,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:38,165 INFO L124 PetriNetUnfolderBase]: 93/482 cut-off events. [2025-03-14 01:34:38,165 INFO L125 PetriNetUnfolderBase]: For 90/103 co-relation queries the response was YES. [2025-03-14 01:34:38,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 482 events. 93/482 cut-off events. For 90/103 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2145 event pairs, 20 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 918. Up to 197 conditions per place. [2025-03-14 01:34:38,168 INFO L140 encePairwiseOnDemand]: 93/104 looper letters, 46 selfloop transitions, 22 changer transitions 0/141 dead transitions. [2025-03-14 01:34:38,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 141 transitions, 569 flow [2025-03-14 01:34:38,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:34:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:34:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2025-03-14 01:34:38,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8189102564102564 [2025-03-14 01:34:38,171 INFO L175 Difference]: Start difference. First operand has 116 places, 120 transitions, 359 flow. Second operand 6 states and 511 transitions. [2025-03-14 01:34:38,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 141 transitions, 569 flow [2025-03-14 01:34:38,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 141 transitions, 565 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:34:38,176 INFO L231 Difference]: Finished difference. Result has 125 places, 141 transitions, 537 flow [2025-03-14 01:34:38,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=537, PETRI_PLACES=125, PETRI_TRANSITIONS=141} [2025-03-14 01:34:38,177 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 18 predicate places. [2025-03-14 01:34:38,177 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 141 transitions, 537 flow [2025-03-14 01:34:38,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 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-14 01:34:38,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:38,179 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] [2025-03-14 01:34:38,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:34:38,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:38,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:38,180 INFO L85 PathProgramCache]: Analyzing trace with hash 90060720, now seen corresponding path program 1 times [2025-03-14 01:34:38,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:38,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890285799] [2025-03-14 01:34:38,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:38,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:38,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-14 01:34:38,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-14 01:34:38,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:38,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:38,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:38,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890285799] [2025-03-14 01:34:38,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890285799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:38,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:38,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:34:38,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331435290] [2025-03-14 01:34:38,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:38,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:34:38,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:38,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:34:38,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:34:38,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2025-03-14 01:34:38,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 141 transitions, 537 flow. Second operand has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 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-14 01:34:38,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:38,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2025-03-14 01:34:38,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:38,685 INFO L124 PetriNetUnfolderBase]: 195/735 cut-off events. [2025-03-14 01:34:38,685 INFO L125 PetriNetUnfolderBase]: For 309/316 co-relation queries the response was YES. [2025-03-14 01:34:38,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 735 events. 195/735 cut-off events. For 309/316 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3988 event pairs, 12 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 1782. Up to 295 conditions per place. [2025-03-14 01:34:38,689 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 56 selfloop transitions, 52 changer transitions 13/198 dead transitions. [2025-03-14 01:34:38,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 198 transitions, 1044 flow [2025-03-14 01:34:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:34:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:34:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2025-03-14 01:34:38,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8894230769230769 [2025-03-14 01:34:38,690 INFO L175 Difference]: Start difference. First operand has 125 places, 141 transitions, 537 flow. Second operand 6 states and 555 transitions. [2025-03-14 01:34:38,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 198 transitions, 1044 flow [2025-03-14 01:34:38,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 198 transitions, 1006 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-14 01:34:38,695 INFO L231 Difference]: Finished difference. Result has 135 places, 181 transitions, 952 flow [2025-03-14 01:34:38,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=952, PETRI_PLACES=135, PETRI_TRANSITIONS=181} [2025-03-14 01:34:38,695 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 28 predicate places. [2025-03-14 01:34:38,695 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 181 transitions, 952 flow [2025-03-14 01:34:38,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 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-14 01:34:38,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:38,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:38,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:34:38,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:38,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2079245317, now seen corresponding path program 1 times [2025-03-14 01:34:38,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:38,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860629852] [2025-03-14 01:34:38,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:38,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-14 01:34:38,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-14 01:34:38,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:38,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:39,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:39,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860629852] [2025-03-14 01:34:39,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860629852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:39,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 01:34:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62223583] [2025-03-14 01:34:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:39,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:34:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:39,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:34:39,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:34:39,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2025-03-14 01:34:39,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 181 transitions, 952 flow. Second operand has 12 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 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-14 01:34:39,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:39,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2025-03-14 01:34:39,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:39,833 INFO L124 PetriNetUnfolderBase]: 189/697 cut-off events. [2025-03-14 01:34:39,833 INFO L125 PetriNetUnfolderBase]: For 731/771 co-relation queries the response was YES. [2025-03-14 01:34:39,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 697 events. 189/697 cut-off events. For 731/771 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3751 event pairs, 18 based on Foata normal form. 21/711 useless extension candidates. Maximal degree in co-relation 2145. Up to 193 conditions per place. [2025-03-14 01:34:39,837 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 115 selfloop transitions, 39 changer transitions 20/235 dead transitions. [2025-03-14 01:34:39,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 235 transitions, 1684 flow [2025-03-14 01:34:39,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 01:34:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 01:34:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 998 transitions. [2025-03-14 01:34:39,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6854395604395604 [2025-03-14 01:34:39,840 INFO L175 Difference]: Start difference. First operand has 135 places, 181 transitions, 952 flow. Second operand 14 states and 998 transitions. [2025-03-14 01:34:39,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 235 transitions, 1684 flow [2025-03-14 01:34:39,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 235 transitions, 1633 flow, removed 18 selfloop flow, removed 3 redundant places. [2025-03-14 01:34:39,851 INFO L231 Difference]: Finished difference. Result has 151 places, 189 transitions, 1096 flow [2025-03-14 01:34:39,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1096, PETRI_PLACES=151, PETRI_TRANSITIONS=189} [2025-03-14 01:34:39,852 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 44 predicate places. [2025-03-14 01:34:39,852 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 189 transitions, 1096 flow [2025-03-14 01:34:39,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 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-14 01:34:39,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:39,852 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:39,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:34:39,853 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:39,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:39,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2023869461, now seen corresponding path program 1 times [2025-03-14 01:34:39,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:39,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811585444] [2025-03-14 01:34:39,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:39,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:39,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-14 01:34:39,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-14 01:34:39,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:39,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:40,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:40,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811585444] [2025-03-14 01:34:40,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811585444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:40,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:40,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 01:34:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968592747] [2025-03-14 01:34:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:40,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:34:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:40,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:34:40,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:34:40,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 104 [2025-03-14 01:34:40,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 189 transitions, 1096 flow. Second operand has 12 states, 12 states have (on average 74.75) internal successors, (897), 12 states have internal predecessors, (897), 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-14 01:34:40,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:40,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 104 [2025-03-14 01:34:40,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:40,924 INFO L124 PetriNetUnfolderBase]: 175/639 cut-off events. [2025-03-14 01:34:40,924 INFO L125 PetriNetUnfolderBase]: For 1074/1108 co-relation queries the response was YES. [2025-03-14 01:34:40,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2249 conditions, 639 events. 175/639 cut-off events. For 1074/1108 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3311 event pairs, 4 based on Foata normal form. 23/660 useless extension candidates. Maximal degree in co-relation 2220. Up to 126 conditions per place. [2025-03-14 01:34:40,927 INFO L140 encePairwiseOnDemand]: 86/104 looper letters, 87 selfloop transitions, 68 changer transitions 11/235 dead transitions. [2025-03-14 01:34:40,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 235 transitions, 1801 flow [2025-03-14 01:34:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:34:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:34:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1035 transitions. [2025-03-14 01:34:40,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7655325443786982 [2025-03-14 01:34:40,929 INFO L175 Difference]: Start difference. First operand has 151 places, 189 transitions, 1096 flow. Second operand 13 states and 1035 transitions. [2025-03-14 01:34:40,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 235 transitions, 1801 flow [2025-03-14 01:34:40,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 235 transitions, 1759 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-03-14 01:34:40,936 INFO L231 Difference]: Finished difference. Result has 158 places, 197 transitions, 1388 flow [2025-03-14 01:34:40,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1388, PETRI_PLACES=158, PETRI_TRANSITIONS=197} [2025-03-14 01:34:40,937 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 51 predicate places. [2025-03-14 01:34:40,937 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 197 transitions, 1388 flow [2025-03-14 01:34:40,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.75) internal successors, (897), 12 states have internal predecessors, (897), 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-14 01:34:40,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:40,938 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:40,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:34:40,938 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:40,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1498523932, now seen corresponding path program 1 times [2025-03-14 01:34:40,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:40,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122201150] [2025-03-14 01:34:40,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:40,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:40,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-14 01:34:40,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-14 01:34:40,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:40,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:41,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:41,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122201150] [2025-03-14 01:34:41,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122201150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:41,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:41,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 01:34:41,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161268956] [2025-03-14 01:34:41,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:41,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:34:41,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:41,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:34:41,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:34:41,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2025-03-14 01:34:41,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 197 transitions, 1388 flow. Second operand has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 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-14 01:34:41,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:41,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2025-03-14 01:34:41,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:41,882 INFO L124 PetriNetUnfolderBase]: 170/660 cut-off events. [2025-03-14 01:34:41,883 INFO L125 PetriNetUnfolderBase]: For 2011/2090 co-relation queries the response was YES. [2025-03-14 01:34:41,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 660 events. 170/660 cut-off events. For 2011/2090 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3510 event pairs, 15 based on Foata normal form. 43/697 useless extension candidates. Maximal degree in co-relation 2526. Up to 192 conditions per place. [2025-03-14 01:34:41,887 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 122 selfloop transitions, 37 changer transitions 9/230 dead transitions. [2025-03-14 01:34:41,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 230 transitions, 2082 flow [2025-03-14 01:34:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 01:34:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 01:34:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1058 transitions. [2025-03-14 01:34:41,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6782051282051282 [2025-03-14 01:34:41,890 INFO L175 Difference]: Start difference. First operand has 158 places, 197 transitions, 1388 flow. Second operand 15 states and 1058 transitions. [2025-03-14 01:34:41,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 230 transitions, 2082 flow [2025-03-14 01:34:41,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 230 transitions, 2052 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-14 01:34:41,904 INFO L231 Difference]: Finished difference. Result has 166 places, 195 transitions, 1416 flow [2025-03-14 01:34:41,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1416, PETRI_PLACES=166, PETRI_TRANSITIONS=195} [2025-03-14 01:34:41,905 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 59 predicate places. [2025-03-14 01:34:41,905 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 195 transitions, 1416 flow [2025-03-14 01:34:41,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 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-14 01:34:41,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:41,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:41,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:34:41,907 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:41,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1114555278, now seen corresponding path program 2 times [2025-03-14 01:34:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:41,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502188384] [2025-03-14 01:34:41,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:34:41,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:41,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-14 01:34:41,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 77 statements. [2025-03-14 01:34:41,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:34:41,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:42,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:42,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502188384] [2025-03-14 01:34:42,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502188384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:42,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:42,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 01:34:42,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039536758] [2025-03-14 01:34:42,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:42,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:34:42,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:42,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:34:42,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:34:42,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2025-03-14 01:34:42,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 195 transitions, 1416 flow. Second operand has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 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-14 01:34:42,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:42,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2025-03-14 01:34:42,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:42,849 INFO L124 PetriNetUnfolderBase]: 167/655 cut-off events. [2025-03-14 01:34:42,849 INFO L125 PetriNetUnfolderBase]: For 2237/2298 co-relation queries the response was YES. [2025-03-14 01:34:42,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 655 events. 167/655 cut-off events. For 2237/2298 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3486 event pairs, 15 based on Foata normal form. 28/677 useless extension candidates. Maximal degree in co-relation 2598. Up to 192 conditions per place. [2025-03-14 01:34:42,853 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 122 selfloop transitions, 35 changer transitions 10/229 dead transitions. [2025-03-14 01:34:42,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 229 transitions, 2118 flow [2025-03-14 01:34:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 01:34:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 01:34:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1124 transitions. [2025-03-14 01:34:42,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6754807692307693 [2025-03-14 01:34:42,856 INFO L175 Difference]: Start difference. First operand has 166 places, 195 transitions, 1416 flow. Second operand 16 states and 1124 transitions. [2025-03-14 01:34:42,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 229 transitions, 2118 flow [2025-03-14 01:34:42,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 229 transitions, 2034 flow, removed 5 selfloop flow, removed 14 redundant places. [2025-03-14 01:34:42,869 INFO L231 Difference]: Finished difference. Result has 168 places, 193 transitions, 1392 flow [2025-03-14 01:34:42,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1392, PETRI_PLACES=168, PETRI_TRANSITIONS=193} [2025-03-14 01:34:42,870 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 61 predicate places. [2025-03-14 01:34:42,870 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 193 transitions, 1392 flow [2025-03-14 01:34:42,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 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-14 01:34:42,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:42,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:42,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:34:42,871 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:42,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:42,872 INFO L85 PathProgramCache]: Analyzing trace with hash 957489808, now seen corresponding path program 3 times [2025-03-14 01:34:42,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:42,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387987041] [2025-03-14 01:34:42,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:34:42,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:42,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 2 equivalence classes. [2025-03-14 01:34:42,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 76 of 77 statements. [2025-03-14 01:34:42,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:34:42,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:43,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:43,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387987041] [2025-03-14 01:34:43,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387987041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:43,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:43,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 01:34:43,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385903369] [2025-03-14 01:34:43,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:43,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:34:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:43,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:34:43,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:34:43,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2025-03-14 01:34:43,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 193 transitions, 1392 flow. Second operand has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 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-14 01:34:43,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:43,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2025-03-14 01:34:43,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:43,684 INFO L124 PetriNetUnfolderBase]: 165/646 cut-off events. [2025-03-14 01:34:43,685 INFO L125 PetriNetUnfolderBase]: For 2089/2120 co-relation queries the response was YES. [2025-03-14 01:34:43,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 646 events. 165/646 cut-off events. For 2089/2120 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3416 event pairs, 15 based on Foata normal form. 13/653 useless extension candidates. Maximal degree in co-relation 2559. Up to 192 conditions per place. [2025-03-14 01:34:43,688 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 118 selfloop transitions, 34 changer transitions 10/224 dead transitions. [2025-03-14 01:34:43,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 224 transitions, 2060 flow [2025-03-14 01:34:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 01:34:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 01:34:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1186 transitions. [2025-03-14 01:34:43,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.670814479638009 [2025-03-14 01:34:43,692 INFO L175 Difference]: Start difference. First operand has 168 places, 193 transitions, 1392 flow. Second operand 17 states and 1186 transitions. [2025-03-14 01:34:43,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 224 transitions, 2060 flow [2025-03-14 01:34:43,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 224 transitions, 1976 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-03-14 01:34:43,702 INFO L231 Difference]: Finished difference. Result has 165 places, 188 transitions, 1339 flow [2025-03-14 01:34:43,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1339, PETRI_PLACES=165, PETRI_TRANSITIONS=188} [2025-03-14 01:34:43,704 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 58 predicate places. [2025-03-14 01:34:43,704 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 188 transitions, 1339 flow [2025-03-14 01:34:43,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 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-14 01:34:43,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:43,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:43,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:34:43,705 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:34:43,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash 80388551, now seen corresponding path program 1 times [2025-03-14 01:34:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:43,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407930147] [2025-03-14 01:34:43,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:43,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:43,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-14 01:34:43,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-14 01:34:43,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:43,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:34:43,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:34:43,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-14 01:34:43,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-14 01:34:43,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:43,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:34:43,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:34:43,752 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:34:43,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-14 01:34:43,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-14 01:34:43,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:34:43,755 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:43,799 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:34:43,799 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:34:43,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:34:43 BasicIcfg [2025-03-14 01:34:43,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:34:43,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:34:43,803 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:34:43,803 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:34:43,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:34:35" (3/4) ... [2025-03-14 01:34:43,804 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 01:34:43,857 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-03-14 01:34:43,883 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:34:43,883 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:34:43,883 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:34:43,884 INFO L158 Benchmark]: Toolchain (without parser) took 9542.32ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 119.6MB in the beginning and 187.4MB in the end (delta: -67.8MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2025-03-14 01:34:43,884 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:34:43,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.47ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 82.1MB in the end (delta: 37.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-14 01:34:43,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.78ms. Allocated memory is still 167.8MB. Free memory was 82.1MB in the beginning and 79.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:34:43,884 INFO L158 Benchmark]: Boogie Preprocessor took 18.32ms. Allocated memory is still 167.8MB. Free memory was 79.7MB in the beginning and 78.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:34:43,884 INFO L158 Benchmark]: IcfgBuilder took 415.65ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 60.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:34:43,887 INFO L158 Benchmark]: TraceAbstraction took 8422.03ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 60.1MB in the beginning and 198.8MB in the end (delta: -138.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:34:43,887 INFO L158 Benchmark]: Witness Printer took 79.74ms. Allocated memory is still 276.8MB. Free memory was 198.8MB in the beginning and 187.4MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:34:43,889 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.47ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 82.1MB in the end (delta: 37.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.78ms. Allocated memory is still 167.8MB. Free memory was 82.1MB in the beginning and 79.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.32ms. Allocated memory is still 167.8MB. Free memory was 79.7MB in the beginning and 78.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 415.65ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 60.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8422.03ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 60.1MB in the beginning and 198.8MB in the end (delta: -138.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 79.74ms. Allocated memory is still 276.8MB. Free memory was 198.8MB in the beginning and 187.4MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1243]: Data race detected Data race detected The following path leads to a data race: [L1223] 0 int *x; VAL [x={0:0}] [L1224] 0 int *y; VAL [x={0:0}, y={0:0}] [L1225] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [m={1:0}, x={0:0}, y={0:0}] [L1234] 0 pthread_t id; VAL [m={1:0}, x={0:0}, y={0:0}] [L1235] 0 int *z; VAL [m={1:0}, x={0:0}, y={0:0}] [L1236] 0 x = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={0:0}] [L1237] 0 y = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={-3:0}] [L1238] 0 z = y VAL [m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1239] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] EXPR 0 *x VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] EXPR 0 \read(*x) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] 0 printf("%d\n",*x) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1228] EXPR 1 *x VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1228] 1 *x = 3 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1243] EXPR 0 \read(*z) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1229] EXPR 1 *y VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1229] 1 *y = 8 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1243] 0 printf("%d\n",*z) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: *y = 8 [1229] * C: *x = 3 [1228] * C: *x = 3 [1228] * C: *x = 3 [1228] * C: *x = 3 [1228] * C: y = malloc(sizeof(int)) [1237] * C: x = malloc(sizeof(int)) [1236] and C: printf("%d\n",*z) [1243] - UnprovableResult [Line: 1236]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: 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: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: 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, 138 locations, 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: 8.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1372 mSDsluCounter, 1552 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1483 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5913 IncrementalHoareTripleChecker+Invalid, 6188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 69 mSDtfsCounter, 5913 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1416occurred in iteration=12, InterpolantAutomatonStates: 114, 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, 2.8s InterpolantComputationTime, 836 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 744 ConstructedInterpolants, 0 QuantifiedInterpolants, 2873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6/6 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-14 01:34:43,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)