./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 f8ab0bd5 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-?-f8ab0bd-m [2025-03-13 22:14:52,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:14:52,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:14:52,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:14:52,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:14:52,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:14:52,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:14:52,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:14:52,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:14:52,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:14:52,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:14:52,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:14:52,915 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:14:52,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:14:52,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:14:52,915 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:14:52,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:14:52,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:14:52,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:14:52,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:14:52,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:14:52,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:14:52,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:14:52,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:14:52,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:14:52,917 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-13 22:14:53,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:14:53,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:14:53,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:14:53,162 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:14:53,162 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:14:53,163 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-13 22:14:54,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eaede917/22e410b53bb94e05bb8498cc1913f5e3/FLAG966b07734 [2025-03-13 22:14:54,597 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:14:54,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i [2025-03-13 22:14:54,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eaede917/22e410b53bb94e05bb8498cc1913f5e3/FLAG966b07734 [2025-03-13 22:14:54,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eaede917/22e410b53bb94e05bb8498cc1913f5e3 [2025-03-13 22:14:54,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:14:54,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:14:54,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:14:54,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:14:54,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:14:54,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:14:54" (1/1) ... [2025-03-13 22:14:54,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb74b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:54, skipping insertion in model container [2025-03-13 22:14:54,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:14:54" (1/1) ... [2025-03-13 22:14:54,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:14:55,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:14:55,097 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:14:55,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:14:55,177 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:14:55,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55 WrapperNode [2025-03-13 22:14:55,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:14:55,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:14:55,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:14:55,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:14:55,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55" (1/1) ... [2025-03-13 22:14:55,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55" (1/1) ... [2025-03-13 22:14:55,215 INFO L138 Inliner]: procedures = 365, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2025-03-13 22:14:55,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:14:55,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:14:55,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:14:55,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:14:55,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55" (1/1) ... [2025-03-13 22:14:55,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55" (1/1) ... [2025-03-13 22:14:55,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55" (1/1) ... [2025-03-13 22:14:55,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55" (1/1) ... [2025-03-13 22:14:55,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55" (1/1) ... [2025-03-13 22:14:55,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55" (1/1) ... [2025-03-13 22:14:55,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55" (1/1) ... [2025-03-13 22:14:55,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55" (1/1) ... [2025-03-13 22:14:55,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:14:55,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:14:55,251 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:14:55,251 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:14:55,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55" (1/1) ... [2025-03-13 22:14:55,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:14:55,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:14:55,284 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-13 22:14:55,287 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-13 22:14:55,303 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:14:55,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:14:55,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:14:55,304 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:14:55,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:14:55,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:14:55,304 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:14:55,304 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:14:55,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:14:55,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:14:55,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:14:55,305 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:14:55,402 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:14:55,404 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:14:55,606 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:14:55,607 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:14:55,607 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:14:55,627 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:14:55,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:14:55 BoogieIcfgContainer [2025-03-13 22:14:55,628 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:14:55,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:14:55,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:14:55,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:14:55,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:14:54" (1/3) ... [2025-03-13 22:14:55,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122b94e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:14:55, skipping insertion in model container [2025-03-13 22:14:55,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:14:55" (2/3) ... [2025-03-13 22:14:55,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122b94e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:14:55, skipping insertion in model container [2025-03-13 22:14:55,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:14:55" (3/3) ... [2025-03-13 22:14:55,635 INFO L128 eAbstractionObserver]: Analyzing ICFG 02-base_25-malloc_race_cp.i [2025-03-13 22:14:55,646 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:14:55,649 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-13 22:14:55,649 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:14:55,704 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:14:55,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 212 flow [2025-03-13 22:14:55,786 INFO L124 PetriNetUnfolderBase]: 0/103 cut-off events. [2025-03-13 22:14:55,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:14:55,790 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-13 22:14:55,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 104 transitions, 212 flow [2025-03-13 22:14:55,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 103 transitions, 209 flow [2025-03-13 22:14:55,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:14:55,806 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;@485555cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:14:55,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-13 22:14:55,813 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:14:55,814 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-13 22:14:55,814 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:14:55,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:55,815 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-13 22:14:55,815 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-13 22:14:55,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1124581080, now seen corresponding path program 1 times [2025-03-13 22:14:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:55,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376329726] [2025-03-13 22:14:55,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:55,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 22:14:55,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 22:14:55,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:55,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:55,974 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-13 22:14:55,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:55,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376329726] [2025-03-13 22:14:55,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376329726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:55,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:55,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:14:55,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592238255] [2025-03-13 22:14:55,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:55,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:14:55,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:56,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:14:56,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:14:56,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2025-03-13 22:14:56,030 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-13 22:14:56,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:56,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2025-03-13 22:14:56,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:56,083 INFO L124 PetriNetUnfolderBase]: 12/234 cut-off events. [2025-03-13 22:14:56,084 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:14:56,086 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-13 22:14:56,088 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 11 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2025-03-13 22:14:56,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 102 transitions, 233 flow [2025-03-13 22:14:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:14:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:14:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-13 22:14:56,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2025-03-13 22:14:56,101 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 209 flow. Second operand 3 states and 284 transitions. [2025-03-13 22:14:56,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 102 transitions, 233 flow [2025-03-13 22:14:56,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:14:56,108 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 210 flow [2025-03-13 22:14:56,110 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-13 22:14:56,112 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 0 predicate places. [2025-03-13 22:14:56,113 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 210 flow [2025-03-13 22:14:56,114 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-13 22:14:56,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:56,114 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-13 22:14:56,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:14:56,115 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-13 22:14:56,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:56,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1115737132, now seen corresponding path program 1 times [2025-03-13 22:14:56,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299597262] [2025-03-13 22:14:56,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:56,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:56,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 22:14:56,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 22:14:56,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:56,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:56,170 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-13 22:14:56,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299597262] [2025-03-13 22:14:56,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299597262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:56,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:56,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:14:56,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323353513] [2025-03-13 22:14:56,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:56,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:14:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:56,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:14:56,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:14:56,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2025-03-13 22:14:56,195 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-13 22:14:56,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:56,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2025-03-13 22:14:56,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:56,248 INFO L124 PetriNetUnfolderBase]: 9/200 cut-off events. [2025-03-13 22:14:56,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:14:56,249 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-13 22:14:56,249 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 11 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-13 22:14:56,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 101 transitions, 234 flow [2025-03-13 22:14:56,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:14:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:14:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-13 22:14:56,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2025-03-13 22:14:56,251 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 210 flow. Second operand 3 states and 284 transitions. [2025-03-13 22:14:56,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 101 transitions, 234 flow [2025-03-13 22:14:56,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 101 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:14:56,253 INFO L231 Difference]: Finished difference. Result has 106 places, 101 transitions, 208 flow [2025-03-13 22:14:56,253 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-13 22:14:56,254 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -1 predicate places. [2025-03-13 22:14:56,254 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 101 transitions, 208 flow [2025-03-13 22:14:56,254 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-13 22:14:56,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:56,254 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-13 22:14:56,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:14:56,254 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-13 22:14:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1064404092, now seen corresponding path program 1 times [2025-03-13 22:14:56,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:56,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914668324] [2025-03-13 22:14:56,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:56,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:56,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 22:14:56,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 22:14:56,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:56,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:56,314 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-13 22:14:56,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:56,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914668324] [2025-03-13 22:14:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914668324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:56,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:14:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488132200] [2025-03-13 22:14:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:56,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:14:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:56,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:14:56,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:14:56,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 104 [2025-03-13 22:14:56,328 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-13 22:14:56,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:56,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 104 [2025-03-13 22:14:56,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:56,363 INFO L124 PetriNetUnfolderBase]: 8/165 cut-off events. [2025-03-13 22:14:56,363 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:14:56,364 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-13 22:14:56,366 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 9 selfloop transitions, 1 changer transitions 0/99 dead transitions. [2025-03-13 22:14:56,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 224 flow [2025-03-13 22:14:56,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:14:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:14:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2025-03-13 22:14:56,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-03-13 22:14:56,367 INFO L175 Difference]: Start difference. First operand has 106 places, 101 transitions, 208 flow. Second operand 3 states and 288 transitions. [2025-03-13 22:14:56,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 224 flow [2025-03-13 22:14:56,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:14:56,369 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 202 flow [2025-03-13 22:14:56,369 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-13 22:14:56,372 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -3 predicate places. [2025-03-13 22:14:56,372 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 202 flow [2025-03-13 22:14:56,372 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-13 22:14:56,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:56,372 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-13 22:14:56,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:14:56,373 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-13 22:14:56,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1481655662, now seen corresponding path program 1 times [2025-03-13 22:14:56,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:56,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851751852] [2025-03-13 22:14:56,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:56,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 22:14:56,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 22:14:56,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:56,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:56,424 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-13 22:14:56,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:56,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851751852] [2025-03-13 22:14:56,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851751852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:56,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:56,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:14:56,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104904781] [2025-03-13 22:14:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:56,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:14:56,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:56,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:14:56,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:14:56,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 104 [2025-03-13 22:14:56,436 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-13 22:14:56,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:56,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 104 [2025-03-13 22:14:56,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:56,495 INFO L124 PetriNetUnfolderBase]: 16/249 cut-off events. [2025-03-13 22:14:56,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:14:56,496 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-13 22:14:56,496 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 12 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-13 22:14:56,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 234 flow [2025-03-13 22:14:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:14:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:14:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-03-13 22:14:56,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358974358974359 [2025-03-13 22:14:56,500 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 202 flow. Second operand 3 states and 292 transitions. [2025-03-13 22:14:56,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 234 flow [2025-03-13 22:14:56,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 101 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:14:56,502 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 211 flow [2025-03-13 22:14:56,502 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-13 22:14:56,503 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -3 predicate places. [2025-03-13 22:14:56,503 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 211 flow [2025-03-13 22:14:56,503 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-13 22:14:56,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:56,503 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-13 22:14:56,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:14:56,504 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-13 22:14:56,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2116502456, now seen corresponding path program 1 times [2025-03-13 22:14:56,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:56,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844070031] [2025-03-13 22:14:56,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:56,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:56,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 22:14:56,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 22:14:56,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:56,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:56,914 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-13 22:14:56,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:56,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844070031] [2025-03-13 22:14:56,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844070031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:56,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:56,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:56,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177264459] [2025-03-13 22:14:56,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:56,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:56,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:56,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:56,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:57,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 104 [2025-03-13 22:14:57,032 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-13 22:14:57,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:57,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 104 [2025-03-13 22:14:57,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:57,204 INFO L124 PetriNetUnfolderBase]: 231/839 cut-off events. [2025-03-13 22:14:57,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:14:57,206 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-13 22:14:57,210 INFO L140 encePairwiseOnDemand]: 88/104 looper letters, 51 selfloop transitions, 41 changer transitions 0/163 dead transitions. [2025-03-13 22:14:57,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 163 transitions, 523 flow [2025-03-13 22:14:57,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 549 transitions. [2025-03-13 22:14:57,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8798076923076923 [2025-03-13 22:14:57,212 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 211 flow. Second operand 6 states and 549 transitions. [2025-03-13 22:14:57,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 163 transitions, 523 flow [2025-03-13 22:14:57,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 163 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:14:57,228 INFO L231 Difference]: Finished difference. Result has 113 places, 141 transitions, 469 flow [2025-03-13 22:14:57,228 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-13 22:14:57,229 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places. [2025-03-13 22:14:57,229 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 141 transitions, 469 flow [2025-03-13 22:14:57,229 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-13 22:14:57,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:57,230 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-13 22:14:57,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:14:57,230 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-13 22:14:57,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1122203880, now seen corresponding path program 1 times [2025-03-13 22:14:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:57,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200462738] [2025-03-13 22:14:57,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:57,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:57,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 22:14:57,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 22:14:57,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:57,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:57,452 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-13 22:14:57,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:57,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200462738] [2025-03-13 22:14:57,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200462738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:57,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351022688] [2025-03-13 22:14:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:57,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:57,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:57,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:57,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 104 [2025-03-13 22:14:57,554 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-13 22:14:57,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:57,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 104 [2025-03-13 22:14:57,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:57,756 INFO L124 PetriNetUnfolderBase]: 285/1134 cut-off events. [2025-03-13 22:14:57,757 INFO L125 PetriNetUnfolderBase]: For 318/367 co-relation queries the response was YES. [2025-03-13 22:14:57,760 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-13 22:14:57,763 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 71 selfloop transitions, 48 changer transitions 0/216 dead transitions. [2025-03-13 22:14:57,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 216 transitions, 971 flow [2025-03-13 22:14:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:57,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 579 transitions. [2025-03-13 22:14:57,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278846153846154 [2025-03-13 22:14:57,766 INFO L175 Difference]: Start difference. First operand has 113 places, 141 transitions, 469 flow. Second operand 6 states and 579 transitions. [2025-03-13 22:14:57,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 216 transitions, 971 flow [2025-03-13 22:14:57,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 216 transitions, 971 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:14:57,774 INFO L231 Difference]: Finished difference. Result has 123 places, 187 transitions, 875 flow [2025-03-13 22:14:57,774 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-13 22:14:57,775 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 16 predicate places. [2025-03-13 22:14:57,775 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 187 transitions, 875 flow [2025-03-13 22:14:57,776 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-13 22:14:57,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:57,776 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-13 22:14:57,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:14:57,776 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-13 22:14:57,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1042648452, now seen corresponding path program 1 times [2025-03-13 22:14:57,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:57,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160680382] [2025-03-13 22:14:57,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:57,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:57,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:14:57,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:14:57,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:57,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:57,848 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-13 22:14:57,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:57,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160680382] [2025-03-13 22:14:57,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160680382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:57,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:57,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:14:57,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923928290] [2025-03-13 22:14:57,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:57,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:14:57,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:57,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:14:57,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:14:57,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 104 [2025-03-13 22:14:57,858 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-13 22:14:57,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:57,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 104 [2025-03-13 22:14:57,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:57,892 INFO L124 PetriNetUnfolderBase]: 39/286 cut-off events. [2025-03-13 22:14:57,892 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-13 22:14:57,893 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-13 22:14:57,893 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 2 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-03-13 22:14:57,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 413 flow [2025-03-13 22:14:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:14:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:14:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2025-03-13 22:14:57,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967948717948718 [2025-03-13 22:14:57,895 INFO L175 Difference]: Start difference. First operand has 123 places, 187 transitions, 875 flow. Second operand 3 states and 302 transitions. [2025-03-13 22:14:57,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 413 flow [2025-03-13 22:14:57,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 120 transitions, 363 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-03-13 22:14:57,898 INFO L231 Difference]: Finished difference. Result has 116 places, 120 transitions, 359 flow [2025-03-13 22:14:57,901 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-13 22:14:57,902 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 9 predicate places. [2025-03-13 22:14:57,902 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 120 transitions, 359 flow [2025-03-13 22:14:57,902 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-13 22:14:57,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:57,904 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-13 22:14:57,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:14:57,904 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-13 22:14:57,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash -167339330, now seen corresponding path program 1 times [2025-03-13 22:14:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355751753] [2025-03-13 22:14:57,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:57,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-13 22:14:57,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-13 22:14:57,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:57,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:58,131 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-13 22:14:58,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:58,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355751753] [2025-03-13 22:14:58,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355751753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:58,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:58,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:58,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436205731] [2025-03-13 22:14:58,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:58,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:58,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:58,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:58,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:58,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 104 [2025-03-13 22:14:58,216 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-13 22:14:58,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:58,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 104 [2025-03-13 22:14:58,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:58,287 INFO L124 PetriNetUnfolderBase]: 93/482 cut-off events. [2025-03-13 22:14:58,287 INFO L125 PetriNetUnfolderBase]: For 90/103 co-relation queries the response was YES. [2025-03-13 22:14:58,288 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-13 22:14:58,290 INFO L140 encePairwiseOnDemand]: 93/104 looper letters, 46 selfloop transitions, 22 changer transitions 0/141 dead transitions. [2025-03-13 22:14:58,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 141 transitions, 569 flow [2025-03-13 22:14:58,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2025-03-13 22:14:58,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8189102564102564 [2025-03-13 22:14:58,291 INFO L175 Difference]: Start difference. First operand has 116 places, 120 transitions, 359 flow. Second operand 6 states and 511 transitions. [2025-03-13 22:14:58,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 141 transitions, 569 flow [2025-03-13 22:14:58,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 141 transitions, 565 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:14:58,294 INFO L231 Difference]: Finished difference. Result has 125 places, 141 transitions, 537 flow [2025-03-13 22:14:58,294 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-13 22:14:58,295 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 18 predicate places. [2025-03-13 22:14:58,295 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 141 transitions, 537 flow [2025-03-13 22:14:58,295 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-13 22:14:58,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:58,295 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-13 22:14:58,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:14:58,296 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-13 22:14:58,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:58,296 INFO L85 PathProgramCache]: Analyzing trace with hash 90060720, now seen corresponding path program 1 times [2025-03-13 22:14:58,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:58,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071307109] [2025-03-13 22:14:58,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:58,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:58,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-13 22:14:58,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-13 22:14:58,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:58,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:58,505 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-13 22:14:58,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:58,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071307109] [2025-03-13 22:14:58,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071307109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:58,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:58,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:14:58,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670625565] [2025-03-13 22:14:58,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:58,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:14:58,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:58,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:14:58,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:14:58,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2025-03-13 22:14:58,601 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-13 22:14:58,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:58,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2025-03-13 22:14:58,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:58,726 INFO L124 PetriNetUnfolderBase]: 195/735 cut-off events. [2025-03-13 22:14:58,726 INFO L125 PetriNetUnfolderBase]: For 309/316 co-relation queries the response was YES. [2025-03-13 22:14:58,727 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-13 22:14:58,729 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 56 selfloop transitions, 52 changer transitions 13/198 dead transitions. [2025-03-13 22:14:58,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 198 transitions, 1044 flow [2025-03-13 22:14:58,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:14:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:14:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2025-03-13 22:14:58,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8894230769230769 [2025-03-13 22:14:58,731 INFO L175 Difference]: Start difference. First operand has 125 places, 141 transitions, 537 flow. Second operand 6 states and 555 transitions. [2025-03-13 22:14:58,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 198 transitions, 1044 flow [2025-03-13 22:14:58,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 198 transitions, 1006 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-13 22:14:58,735 INFO L231 Difference]: Finished difference. Result has 135 places, 181 transitions, 952 flow [2025-03-13 22:14:58,735 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-13 22:14:58,736 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 28 predicate places. [2025-03-13 22:14:58,736 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 181 transitions, 952 flow [2025-03-13 22:14:58,736 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-13 22:14:58,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:58,737 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-13 22:14:58,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:14:58,737 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-13 22:14:58,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:58,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2079245317, now seen corresponding path program 1 times [2025-03-13 22:14:58,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:58,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461285441] [2025-03-13 22:14:58,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:58,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:58,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 22:14:58,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 22:14:58,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:58,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:14:59,090 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-13 22:14:59,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:14:59,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461285441] [2025-03-13 22:14:59,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461285441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:14:59,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:14:59,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 22:14:59,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776427555] [2025-03-13 22:14:59,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:14:59,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 22:14:59,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:14:59,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 22:14:59,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-13 22:14:59,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2025-03-13 22:14:59,444 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-13 22:14:59,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:14:59,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2025-03-13 22:14:59,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:14:59,751 INFO L124 PetriNetUnfolderBase]: 189/697 cut-off events. [2025-03-13 22:14:59,751 INFO L125 PetriNetUnfolderBase]: For 731/771 co-relation queries the response was YES. [2025-03-13 22:14:59,753 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-13 22:14:59,755 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 115 selfloop transitions, 39 changer transitions 20/235 dead transitions. [2025-03-13 22:14:59,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 235 transitions, 1684 flow [2025-03-13 22:14:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 22:14:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 22:14:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 998 transitions. [2025-03-13 22:14:59,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6854395604395604 [2025-03-13 22:14:59,757 INFO L175 Difference]: Start difference. First operand has 135 places, 181 transitions, 952 flow. Second operand 14 states and 998 transitions. [2025-03-13 22:14:59,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 235 transitions, 1684 flow [2025-03-13 22:14:59,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 235 transitions, 1633 flow, removed 18 selfloop flow, removed 3 redundant places. [2025-03-13 22:14:59,766 INFO L231 Difference]: Finished difference. Result has 151 places, 189 transitions, 1096 flow [2025-03-13 22:14:59,766 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-13 22:14:59,766 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 44 predicate places. [2025-03-13 22:14:59,767 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 189 transitions, 1096 flow [2025-03-13 22:14:59,767 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-13 22:14:59,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:14:59,767 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-13 22:14:59,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:14:59,767 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-13 22:14:59,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:14:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2023869461, now seen corresponding path program 1 times [2025-03-13 22:14:59,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:14:59,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949531067] [2025-03-13 22:14:59,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:14:59,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:14:59,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 22:14:59,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 22:14:59,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:14:59,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:00,055 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-13 22:15:00,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:00,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949531067] [2025-03-13 22:15:00,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949531067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:00,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:00,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 22:15:00,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111629613] [2025-03-13 22:15:00,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:00,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 22:15:00,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:00,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 22:15:00,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-13 22:15:00,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 104 [2025-03-13 22:15:00,460 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-13 22:15:00,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:00,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 104 [2025-03-13 22:15:00,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:00,762 INFO L124 PetriNetUnfolderBase]: 175/639 cut-off events. [2025-03-13 22:15:00,762 INFO L125 PetriNetUnfolderBase]: For 1074/1108 co-relation queries the response was YES. [2025-03-13 22:15:00,763 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-13 22:15:00,765 INFO L140 encePairwiseOnDemand]: 86/104 looper letters, 87 selfloop transitions, 68 changer transitions 11/235 dead transitions. [2025-03-13 22:15:00,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 235 transitions, 1801 flow [2025-03-13 22:15:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 22:15:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 22:15:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1035 transitions. [2025-03-13 22:15:00,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7655325443786982 [2025-03-13 22:15:00,768 INFO L175 Difference]: Start difference. First operand has 151 places, 189 transitions, 1096 flow. Second operand 13 states and 1035 transitions. [2025-03-13 22:15:00,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 235 transitions, 1801 flow [2025-03-13 22:15:00,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 235 transitions, 1759 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-03-13 22:15:00,776 INFO L231 Difference]: Finished difference. Result has 158 places, 197 transitions, 1388 flow [2025-03-13 22:15:00,777 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-13 22:15:00,777 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 51 predicate places. [2025-03-13 22:15:00,777 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 197 transitions, 1388 flow [2025-03-13 22:15:00,777 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-13 22:15:00,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:00,778 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-13 22:15:00,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:15:00,778 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-13 22:15:00,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:00,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1498523932, now seen corresponding path program 1 times [2025-03-13 22:15:00,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:00,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533136348] [2025-03-13 22:15:00,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:00,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-13 22:15:00,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 22:15:00,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:00,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:01,068 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-13 22:15:01,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:01,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533136348] [2025-03-13 22:15:01,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533136348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:01,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:01,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 22:15:01,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800704425] [2025-03-13 22:15:01,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:01,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 22:15:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:01,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 22:15:01,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-13 22:15:01,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2025-03-13 22:15:01,357 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-13 22:15:01,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:01,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2025-03-13 22:15:01,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:01,658 INFO L124 PetriNetUnfolderBase]: 170/660 cut-off events. [2025-03-13 22:15:01,658 INFO L125 PetriNetUnfolderBase]: For 2011/2090 co-relation queries the response was YES. [2025-03-13 22:15:01,660 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-13 22:15:01,662 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 122 selfloop transitions, 37 changer transitions 9/230 dead transitions. [2025-03-13 22:15:01,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 230 transitions, 2082 flow [2025-03-13 22:15:01,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 22:15:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 22:15:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1058 transitions. [2025-03-13 22:15:01,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6782051282051282 [2025-03-13 22:15:01,665 INFO L175 Difference]: Start difference. First operand has 158 places, 197 transitions, 1388 flow. Second operand 15 states and 1058 transitions. [2025-03-13 22:15:01,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 230 transitions, 2082 flow [2025-03-13 22:15:01,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 230 transitions, 2052 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 22:15:01,680 INFO L231 Difference]: Finished difference. Result has 166 places, 195 transitions, 1416 flow [2025-03-13 22:15:01,680 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-13 22:15:01,682 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 59 predicate places. [2025-03-13 22:15:01,682 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 195 transitions, 1416 flow [2025-03-13 22:15:01,683 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-13 22:15:01,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:01,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:15:01,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:15:01,683 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-13 22:15:01,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:01,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1114555278, now seen corresponding path program 2 times [2025-03-13 22:15:01,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:01,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348719910] [2025-03-13 22:15:01,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:01,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:01,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-13 22:15:01,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 77 statements. [2025-03-13 22:15:01,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:15:01,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:01,956 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-13 22:15:01,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:01,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348719910] [2025-03-13 22:15:01,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348719910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:01,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:01,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 22:15:01,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817308946] [2025-03-13 22:15:01,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:01,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 22:15:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:01,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 22:15:01,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-13 22:15:02,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2025-03-13 22:15:02,284 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-13 22:15:02,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:02,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2025-03-13 22:15:02,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:02,618 INFO L124 PetriNetUnfolderBase]: 167/655 cut-off events. [2025-03-13 22:15:02,618 INFO L125 PetriNetUnfolderBase]: For 2237/2298 co-relation queries the response was YES. [2025-03-13 22:15:02,620 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-13 22:15:02,622 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 122 selfloop transitions, 35 changer transitions 10/229 dead transitions. [2025-03-13 22:15:02,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 229 transitions, 2118 flow [2025-03-13 22:15:02,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-13 22:15:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-13 22:15:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1124 transitions. [2025-03-13 22:15:02,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6754807692307693 [2025-03-13 22:15:02,625 INFO L175 Difference]: Start difference. First operand has 166 places, 195 transitions, 1416 flow. Second operand 16 states and 1124 transitions. [2025-03-13 22:15:02,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 229 transitions, 2118 flow [2025-03-13 22:15:02,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 229 transitions, 2034 flow, removed 5 selfloop flow, removed 14 redundant places. [2025-03-13 22:15:02,638 INFO L231 Difference]: Finished difference. Result has 168 places, 193 transitions, 1392 flow [2025-03-13 22:15:02,638 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-13 22:15:02,639 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 61 predicate places. [2025-03-13 22:15:02,639 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 193 transitions, 1392 flow [2025-03-13 22:15:02,640 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-13 22:15:02,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:02,640 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-13 22:15:02,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:15:02,640 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-13 22:15:02,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:02,640 INFO L85 PathProgramCache]: Analyzing trace with hash 957489808, now seen corresponding path program 3 times [2025-03-13 22:15:02,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:02,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037453075] [2025-03-13 22:15:02,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:15:02,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:02,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 2 equivalence classes. [2025-03-13 22:15:02,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 76 of 77 statements. [2025-03-13 22:15:02,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 22:15:02,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:02,895 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-13 22:15:02,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037453075] [2025-03-13 22:15:02,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037453075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:02,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:02,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 22:15:02,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136348790] [2025-03-13 22:15:02,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:02,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 22:15:02,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:02,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 22:15:02,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-13 22:15:03,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2025-03-13 22:15:03,128 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-13 22:15:03,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:03,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2025-03-13 22:15:03,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:03,430 INFO L124 PetriNetUnfolderBase]: 165/646 cut-off events. [2025-03-13 22:15:03,430 INFO L125 PetriNetUnfolderBase]: For 2089/2120 co-relation queries the response was YES. [2025-03-13 22:15:03,432 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-13 22:15:03,435 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 118 selfloop transitions, 34 changer transitions 10/224 dead transitions. [2025-03-13 22:15:03,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 224 transitions, 2060 flow [2025-03-13 22:15:03,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 22:15:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 22:15:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1186 transitions. [2025-03-13 22:15:03,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.670814479638009 [2025-03-13 22:15:03,439 INFO L175 Difference]: Start difference. First operand has 168 places, 193 transitions, 1392 flow. Second operand 17 states and 1186 transitions. [2025-03-13 22:15:03,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 224 transitions, 2060 flow [2025-03-13 22:15:03,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 224 transitions, 1976 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-03-13 22:15:03,452 INFO L231 Difference]: Finished difference. Result has 165 places, 188 transitions, 1339 flow [2025-03-13 22:15:03,453 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-13 22:15:03,453 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 58 predicate places. [2025-03-13 22:15:03,454 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 188 transitions, 1339 flow [2025-03-13 22:15:03,454 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-13 22:15:03,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:03,454 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-13 22:15:03,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:15:03,454 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-13 22:15:03,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash 80388551, now seen corresponding path program 1 times [2025-03-13 22:15:03,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:03,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250577184] [2025-03-13 22:15:03,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:03,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:15:03,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:15:03,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:03,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:15:03,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:15:03,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:15:03,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:15:03,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:03,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:15:03,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:15:03,516 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:15:03,518 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-03-13 22:15:03,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-13 22:15:03,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-13 22:15:03,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-13 22:15:03,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-13 22:15:03,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-13 22:15:03,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-03-13 22:15:03,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-13 22:15:03,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-13 22:15:03,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-13 22:15:03,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-13 22:15:03,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-13 22:15:03,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-13 22:15:03,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-13 22:15:03,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-13 22:15:03,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:15:03,521 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:15:03,559 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:15:03,559 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:15:03,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:15:03 BasicIcfg [2025-03-13 22:15:03,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:15:03,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:15:03,566 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:15:03,566 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:15:03,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:14:55" (3/4) ... [2025-03-13 22:15:03,568 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 22:15:03,629 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-03-13 22:15:03,666 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:15:03,667 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:15:03,667 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:15:03,667 INFO L158 Benchmark]: Toolchain (without parser) took 9033.55ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 104.3MB in the beginning and 297.4MB in the end (delta: -193.1MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2025-03-13 22:15:03,667 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:15:03,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.66ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 66.5MB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-13 22:15:03,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.67ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 64.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:15:03,668 INFO L158 Benchmark]: Boogie Preprocessor took 34.05ms. Allocated memory is still 142.6MB. Free memory was 64.5MB in the beginning and 63.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:15:03,668 INFO L158 Benchmark]: IcfgBuilder took 377.33ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 46.5MB in the end (delta: 17.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:15:03,669 INFO L158 Benchmark]: TraceAbstraction took 7935.91ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 45.5MB in the beginning and 307.2MB in the end (delta: -261.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:15:03,669 INFO L158 Benchmark]: Witness Printer took 100.87ms. Allocated memory is still 385.9MB. Free memory was 307.2MB in the beginning and 297.4MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:15:03,671 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.22ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.66ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 66.5MB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.67ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 64.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.05ms. Allocated memory is still 142.6MB. Free memory was 64.5MB in the beginning and 63.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 377.33ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 46.5MB in the end (delta: 17.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7935.91ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 45.5MB in the beginning and 307.2MB in the end (delta: -261.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 100.87ms. Allocated memory is still 385.9MB. Free memory was 307.2MB in the beginning and 297.4MB in the end (delta: 9.8MB). 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: *x = 3 [1228] * C: y = malloc(sizeof(int)) [1237] * C: *x = 3 [1228] * C: x = malloc(sizeof(int)) [1236] * C: *x = 3 [1228] * C: *y = 8 [1229] * C: *x = 3 [1228] 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: 7.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1372 mSDsluCounter, 1552 SdHoareTripleChecker+Invalid, 2.5s 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, 0.9s 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.6s 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-13 22:15:03,683 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)