./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/03-practical_08-nonterm1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/03-practical_08-nonterm1.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 68241c415e195cda32e2ec49a31f5c0e3a220e5729b169fd07b350b195e62294 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:56:36,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:56:36,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:56:36,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:56:36,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:56:36,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:56:36,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:56:36,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:56:36,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:56:36,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:56:36,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:56:36,938 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:56:36,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:56:36,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:56:36,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:56:36,939 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 -> 68241c415e195cda32e2ec49a31f5c0e3a220e5729b169fd07b350b195e62294 [2025-03-08 21:56:37,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:56:37,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:56:37,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:56:37,202 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:56:37,202 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:56:37,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/03-practical_08-nonterm1.i [2025-03-08 21:56:38,374 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abb55d8e/40940fa14416496ba674c94dd0ab4b6b/FLAG891c4bd8c [2025-03-08 21:56:38,669 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:56:38,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/03-practical_08-nonterm1.i [2025-03-08 21:56:38,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abb55d8e/40940fa14416496ba674c94dd0ab4b6b/FLAG891c4bd8c [2025-03-08 21:56:38,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abb55d8e/40940fa14416496ba674c94dd0ab4b6b [2025-03-08 21:56:38,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:56:38,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:56:38,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:56:38,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:56:38,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:56:38,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:56:38" (1/1) ... [2025-03-08 21:56:38,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67adea4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:38, skipping insertion in model container [2025-03-08 21:56:38,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:56:38" (1/1) ... [2025-03-08 21:56:38,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:56:39,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:56:39,269 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:56:39,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:56:39,357 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:56:39,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39 WrapperNode [2025-03-08 21:56:39,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:56:39,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:56:39,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:56:39,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:56:39,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39" (1/1) ... [2025-03-08 21:56:39,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39" (1/1) ... [2025-03-08 21:56:39,391 INFO L138 Inliner]: procedures = 264, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2025-03-08 21:56:39,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:56:39,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:56:39,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:56:39,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:56:39,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39" (1/1) ... [2025-03-08 21:56:39,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39" (1/1) ... [2025-03-08 21:56:39,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39" (1/1) ... [2025-03-08 21:56:39,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39" (1/1) ... [2025-03-08 21:56:39,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39" (1/1) ... [2025-03-08 21:56:39,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39" (1/1) ... [2025-03-08 21:56:39,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39" (1/1) ... [2025-03-08 21:56:39,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39" (1/1) ... [2025-03-08 21:56:39,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:56:39,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:56:39,413 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:56:39,413 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:56:39,414 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39" (1/1) ... [2025-03-08 21:56:39,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:56:39,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:56:39,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:56:39,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:56:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:56:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:56:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:56:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 21:56:39,459 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 21:56:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:56:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:56:39,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:56:39,460 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:56:39,553 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:56:39,555 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:56:39,685 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:56:39,685 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:56:39,701 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:56:39,701 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:56:39,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:39 BoogieIcfgContainer [2025-03-08 21:56:39,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:56:39,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:56:39,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:56:39,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:56:39,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:56:38" (1/3) ... [2025-03-08 21:56:39,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8324cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:56:39, skipping insertion in model container [2025-03-08 21:56:39,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:39" (2/3) ... [2025-03-08 21:56:39,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8324cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:56:39, skipping insertion in model container [2025-03-08 21:56:39,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:39" (3/3) ... [2025-03-08 21:56:39,708 INFO L128 eAbstractionObserver]: Analyzing ICFG 03-practical_08-nonterm1.i [2025-03-08 21:56:39,717 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:56:39,719 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 03-practical_08-nonterm1.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 7 error locations. [2025-03-08 21:56:39,719 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:56:39,754 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 21:56:39,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 88 transitions, 183 flow [2025-03-08 21:56:39,807 INFO L124 PetriNetUnfolderBase]: 1/87 cut-off events. [2025-03-08 21:56:39,810 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:56:39,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 87 events. 1/87 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-03-08 21:56:39,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 88 transitions, 183 flow [2025-03-08 21:56:39,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 81 transitions, 168 flow [2025-03-08 21:56:39,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:56:39,830 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;@3ef608f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:56:39,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-08 21:56:39,838 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:56:39,838 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-03-08 21:56:39,838 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:56:39,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:39,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:39,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:56:39,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash 276388281, now seen corresponding path program 1 times [2025-03-08 21:56:39,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:39,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402630083] [2025-03-08 21:56:39,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:39,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:39,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 21:56:39,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 21:56:39,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:39,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:40,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:40,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402630083] [2025-03-08 21:56:40,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402630083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:40,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:40,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:40,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020412754] [2025-03-08 21:56:40,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:40,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:40,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:40,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:40,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:40,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 88 [2025-03-08 21:56:40,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:40,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:40,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 88 [2025-03-08 21:56:40,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:40,231 INFO L124 PetriNetUnfolderBase]: 74/350 cut-off events. [2025-03-08 21:56:40,233 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:56:40,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 350 events. 74/350 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1565 event pairs, 27 based on Foata normal form. 8/323 useless extension candidates. Maximal degree in co-relation 488. Up to 89 conditions per place. [2025-03-08 21:56:40,237 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 25 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2025-03-08 21:56:40,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 88 transitions, 247 flow [2025-03-08 21:56:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2025-03-08 21:56:40,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875 [2025-03-08 21:56:40,250 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 168 flow. Second operand 3 states and 231 transitions. [2025-03-08 21:56:40,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 88 transitions, 247 flow [2025-03-08 21:56:40,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 88 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:56:40,256 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 226 flow [2025-03-08 21:56:40,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2025-03-08 21:56:40,262 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -5 predicate places. [2025-03-08 21:56:40,263 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 226 flow [2025-03-08 21:56:40,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:40,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:40,264 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] [2025-03-08 21:56:40,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:56:40,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:56:40,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash 480644347, now seen corresponding path program 1 times [2025-03-08 21:56:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:40,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851655849] [2025-03-08 21:56:40,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:40,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:40,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 21:56:40,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 21:56:40,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:40,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:40,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:40,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851655849] [2025-03-08 21:56:40,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851655849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:40,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:40,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:40,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465648824] [2025-03-08 21:56:40,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:40,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:40,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:40,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:40,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:40,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 88 [2025-03-08 21:56:40,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:40,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:40,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 88 [2025-03-08 21:56:40,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:40,427 INFO L124 PetriNetUnfolderBase]: 81/384 cut-off events. [2025-03-08 21:56:40,427 INFO L125 PetriNetUnfolderBase]: For 161/168 co-relation queries the response was YES. [2025-03-08 21:56:40,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 384 events. 81/384 cut-off events. For 161/168 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1817 event pairs, 36 based on Foata normal form. 4/360 useless extension candidates. Maximal degree in co-relation 687. Up to 143 conditions per place. [2025-03-08 21:56:40,430 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 23 selfloop transitions, 7 changer transitions 0/89 dead transitions. [2025-03-08 21:56:40,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 89 transitions, 310 flow [2025-03-08 21:56:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2025-03-08 21:56:40,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8636363636363636 [2025-03-08 21:56:40,432 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 226 flow. Second operand 3 states and 228 transitions. [2025-03-08 21:56:40,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 89 transitions, 310 flow [2025-03-08 21:56:40,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 89 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:40,435 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 264 flow [2025-03-08 21:56:40,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2025-03-08 21:56:40,435 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2025-03-08 21:56:40,435 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 264 flow [2025-03-08 21:56:40,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:40,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:40,436 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] [2025-03-08 21:56:40,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:56:40,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:56:40,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:40,437 INFO L85 PathProgramCache]: Analyzing trace with hash 980184275, now seen corresponding path program 1 times [2025-03-08 21:56:40,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:40,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436085289] [2025-03-08 21:56:40,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:40,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:40,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 21:56:40,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 21:56:40,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:40,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:40,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:40,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436085289] [2025-03-08 21:56:40,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436085289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:40,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:40,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:40,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853283799] [2025-03-08 21:56:40,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:40,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:40,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:40,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:40,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:40,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 88 [2025-03-08 21:56:40,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:40,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:40,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 88 [2025-03-08 21:56:40,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:40,596 INFO L124 PetriNetUnfolderBase]: 127/514 cut-off events. [2025-03-08 21:56:40,596 INFO L125 PetriNetUnfolderBase]: For 235/244 co-relation queries the response was YES. [2025-03-08 21:56:40,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 514 events. 127/514 cut-off events. For 235/244 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2664 event pairs, 45 based on Foata normal form. 5/474 useless extension candidates. Maximal degree in co-relation 991. Up to 198 conditions per place. [2025-03-08 21:56:40,599 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 26 selfloop transitions, 12 changer transitions 1/99 dead transitions. [2025-03-08 21:56:40,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 99 transitions, 386 flow [2025-03-08 21:56:40,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2025-03-08 21:56:40,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8598484848484849 [2025-03-08 21:56:40,604 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 264 flow. Second operand 3 states and 227 transitions. [2025-03-08 21:56:40,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 99 transitions, 386 flow [2025-03-08 21:56:40,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 99 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:40,610 INFO L231 Difference]: Finished difference. Result has 83 places, 95 transitions, 348 flow [2025-03-08 21:56:40,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=83, PETRI_TRANSITIONS=95} [2025-03-08 21:56:40,611 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2025-03-08 21:56:40,612 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 95 transitions, 348 flow [2025-03-08 21:56:40,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:40,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:40,612 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] [2025-03-08 21:56:40,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:56:40,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:56:40,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:40,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1310423376, now seen corresponding path program 1 times [2025-03-08 21:56:40,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:40,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518283616] [2025-03-08 21:56:40,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:40,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 21:56:40,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 21:56:40,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:40,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:40,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:40,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518283616] [2025-03-08 21:56:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518283616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:40,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:40,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:56:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834331255] [2025-03-08 21:56:40,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:40,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:40,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:40,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:40,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 88 [2025-03-08 21:56:40,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 95 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:40,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:40,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 88 [2025-03-08 21:56:40,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:40,805 INFO L124 PetriNetUnfolderBase]: 31/227 cut-off events. [2025-03-08 21:56:40,805 INFO L125 PetriNetUnfolderBase]: For 79/83 co-relation queries the response was YES. [2025-03-08 21:56:40,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 227 events. 31/227 cut-off events. For 79/83 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 849 event pairs, 4 based on Foata normal form. 2/214 useless extension candidates. Maximal degree in co-relation 377. Up to 36 conditions per place. [2025-03-08 21:56:40,806 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 4 selfloop transitions, 5 changer transitions 2/85 dead transitions. [2025-03-08 21:56:40,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 85 transitions, 290 flow [2025-03-08 21:56:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2025-03-08 21:56:40,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9356060606060606 [2025-03-08 21:56:40,808 INFO L175 Difference]: Start difference. First operand has 83 places, 95 transitions, 348 flow. Second operand 3 states and 247 transitions. [2025-03-08 21:56:40,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 85 transitions, 290 flow [2025-03-08 21:56:40,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 85 transitions, 258 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-08 21:56:40,814 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 240 flow [2025-03-08 21:56:40,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2025-03-08 21:56:40,814 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -5 predicate places. [2025-03-08 21:56:40,815 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 240 flow [2025-03-08 21:56:40,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:40,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:40,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:56:40,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:56:40,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash -429993149, now seen corresponding path program 1 times [2025-03-08 21:56:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:40,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395144229] [2025-03-08 21:56:40,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:40,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 21:56:40,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 21:56:40,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:40,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:40,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:40,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395144229] [2025-03-08 21:56:40,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395144229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:40,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:40,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:40,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238939638] [2025-03-08 21:56:40,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:40,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:40,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:40,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:40,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 88 [2025-03-08 21:56:40,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:40,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:40,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 88 [2025-03-08 21:56:40,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:40,957 INFO L124 PetriNetUnfolderBase]: 69/303 cut-off events. [2025-03-08 21:56:40,957 INFO L125 PetriNetUnfolderBase]: For 145/148 co-relation queries the response was YES. [2025-03-08 21:56:40,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 303 events. 69/303 cut-off events. For 145/148 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1251 event pairs, 24 based on Foata normal form. 1/289 useless extension candidates. Maximal degree in co-relation 616. Up to 116 conditions per place. [2025-03-08 21:56:40,958 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 20 selfloop transitions, 7 changer transitions 6/89 dead transitions. [2025-03-08 21:56:40,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 89 transitions, 332 flow [2025-03-08 21:56:40,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:40,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2025-03-08 21:56:40,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8446969696969697 [2025-03-08 21:56:40,960 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 240 flow. Second operand 3 states and 223 transitions. [2025-03-08 21:56:40,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 89 transitions, 332 flow [2025-03-08 21:56:40,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 332 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:56:40,962 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 276 flow [2025-03-08 21:56:40,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2025-03-08 21:56:40,963 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2025-03-08 21:56:40,963 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 276 flow [2025-03-08 21:56:40,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:40,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:40,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:40,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:56:40,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:56:40,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:40,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1833389895, now seen corresponding path program 1 times [2025-03-08 21:56:40,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:40,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084676954] [2025-03-08 21:56:40,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:40,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:40,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 21:56:40,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 21:56:40,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:40,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:56:40,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:56:40,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 21:56:41,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 21:56:41,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:41,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:56:41,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:56:41,030 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:56:41,030 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (11 of 12 remaining) [2025-03-08 21:56:41,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-08 21:56:41,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-08 21:56:41,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-08 21:56:41,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 12 remaining) [2025-03-08 21:56:41,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-08 21:56:41,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-08 21:56:41,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-08 21:56:41,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-08 21:56:41,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-08 21:56:41,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-08 21:56:41,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-08 21:56:41,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:56:41,035 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 21:56:41,071 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:56:41,071 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:56:41,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:56:41 BasicIcfg [2025-03-08 21:56:41,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:56:41,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:56:41,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:56:41,077 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:56:41,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:39" (3/4) ... [2025-03-08 21:56:41,078 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 21:56:41,121 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-03-08 21:56:41,153 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:56:41,153 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:56:41,153 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:56:41,154 INFO L158 Benchmark]: Toolchain (without parser) took 2203.67ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 50.9MB in the end (delta: 61.3MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2025-03-08 21:56:41,154 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:56:41,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.38ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 84.2MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 21:56:41,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.43ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:56:41,156 INFO L158 Benchmark]: Boogie Preprocessor took 16.49ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 81.4MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:56:41,157 INFO L158 Benchmark]: IcfgBuilder took 289.44ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 65.8MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:56:41,158 INFO L158 Benchmark]: TraceAbstraction took 1371.89ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 59.2MB in the end (delta: 5.8MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2025-03-08 21:56:41,158 INFO L158 Benchmark]: Witness Printer took 77.07ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 50.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:56:41,159 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.13ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.38ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 84.2MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.43ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.49ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 81.4MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 289.44ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 65.8MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1371.89ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 59.2MB in the end (delta: 5.8MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Witness Printer took 77.07ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 50.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 924]: Data race detected Data race detected The following path leads to a data race: [L918] 0 int myglobal; VAL [myglobal=0] [L919] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={1:0}, myglobal=0] [L920] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={1:0}, mutex2={2:0}, myglobal=0] [L936] 0 pthread_t id; VAL [mutex1={1:0}, mutex2={2:0}, myglobal=0] [L937] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [id=-1, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L930] EXPR 1 myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L930] 1 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={1:0}, mutex2={2:0}, myglobal=1] [L932] CALL 1 fun() [L922] 1 int i = __VERIFIER_nondet_int(); VAL [i=0, mutex1={1:0}, mutex2={2:0}, myglobal=1] [L939] EXPR 0 myglobal+1 VAL [id=-1, mutex1={1:0}, mutex2={2:0}, myglobal=1] [L924] 1 myglobal+1 VAL [i=0, mutex1={1:0}, mutex2={2:0}, myglobal=1] [L939] 0 myglobal=myglobal+1 VAL [id=-1, mutex1={1:0}, mutex2={2:0}, myglobal=2] [L924] 1 myglobal+1 VAL [i=0, mutex1={1:0}, mutex2={2:0}, myglobal=2] Now there is a data race on ~myglobal~0 between C: myglobal=myglobal+1 [939] and C: myglobal+1 [924] - UnprovableResult [Line: 939]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 939]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 942]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 937]: 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: 930]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 924]: 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, 127 locations, 128 edges, 12 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: 1.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 235 IncrementalHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 34 mSDtfsCounter, 235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 21:56:41,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)