./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/05-lval_ls_08-glob_fld_2_rc.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/05-lval_ls_08-glob_fld_2_rc.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 9df11a052e2c7230e1edfb210274e89333c68b57c4137552a35d25fe623d9561 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:57:21,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:57:21,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:57:21,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:57:21,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:57:21,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:57:21,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:57:21,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:57:21,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:57:21,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:57:21,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:57:21,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:57:21,670 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:57:21,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:57:21,671 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:57:21,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:21,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:57:21,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:57:21,672 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:57:21,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:57:21,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:57:21,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:57:21,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:57:21,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:57:21,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:57:21,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:57:21,672 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 -> 9df11a052e2c7230e1edfb210274e89333c68b57c4137552a35d25fe623d9561 [2025-03-08 21:57:21,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:57:21,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:57:21,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:57:21,897 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:57:21,897 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:57:21,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/05-lval_ls_08-glob_fld_2_rc.i [2025-03-08 21:57:23,102 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2818a83ca/6f13b53ec01647969871ad9ddb964c6d/FLAG687958470 [2025-03-08 21:57:23,376 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:57:23,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/05-lval_ls_08-glob_fld_2_rc.i [2025-03-08 21:57:23,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2818a83ca/6f13b53ec01647969871ad9ddb964c6d/FLAG687958470 [2025-03-08 21:57:23,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2818a83ca/6f13b53ec01647969871ad9ddb964c6d [2025-03-08 21:57:23,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:57:23,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:57:23,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:23,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:57:23,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:57:23,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:23" (1/1) ... [2025-03-08 21:57:23,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aca6b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:23, skipping insertion in model container [2025-03-08 21:57:23,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:23" (1/1) ... [2025-03-08 21:57:23,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:57:23,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:23,597 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:57:23,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:23,650 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:57:23,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:23 WrapperNode [2025-03-08 21:57:23,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:23,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:23,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:57:23,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:57:23,655 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:57:23" (1/1) ... [2025-03-08 21:57:23,662 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:57:23" (1/1) ... [2025-03-08 21:57:23,672 INFO L138 Inliner]: procedures = 160, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2025-03-08 21:57:23,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:23,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:57:23,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:57:23,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:57:23,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:23" (1/1) ... [2025-03-08 21:57:23,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:23" (1/1) ... [2025-03-08 21:57:23,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:23" (1/1) ... [2025-03-08 21:57:23,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:23" (1/1) ... [2025-03-08 21:57:23,687 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:23" (1/1) ... [2025-03-08 21:57:23,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:23" (1/1) ... [2025-03-08 21:57:23,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:23" (1/1) ... [2025-03-08 21:57:23,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:23" (1/1) ... [2025-03-08 21:57:23,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:57:23,691 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:57:23,693 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:57:23,693 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:57:23,696 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:23" (1/1) ... [2025-03-08 21:57:23,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:23,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:23,718 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:57:23,720 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:57:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:57:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:57:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:57:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 21:57:23,736 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 21:57:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:57:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:57:23,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:57:23,737 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:57:23,812 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:57:23,814 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:57:23,926 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:57:23,926 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:57:23,932 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:57:23,932 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:57:23,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:23 BoogieIcfgContainer [2025-03-08 21:57:23,933 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:57:23,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:57:23,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:57:23,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:57:23,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:57:23" (1/3) ... [2025-03-08 21:57:23,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db7cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:23, skipping insertion in model container [2025-03-08 21:57:23,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:23" (2/3) ... [2025-03-08 21:57:23,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db7cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:23, skipping insertion in model container [2025-03-08 21:57:23,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:23" (3/3) ... [2025-03-08 21:57:23,939 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_08-glob_fld_2_rc.i [2025-03-08 21:57:23,947 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:57:23,949 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_08-glob_fld_2_rc.i that has 2 procedures, 69 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-08 21:57:23,949 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:57:24,006 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:57:24,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 91 transitions, 190 flow [2025-03-08 21:57:24,060 INFO L124 PetriNetUnfolderBase]: 0/89 cut-off events. [2025-03-08 21:57:24,064 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:24,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 0/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-08 21:57:24,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 91 transitions, 190 flow [2025-03-08 21:57:24,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 89 transitions, 184 flow [2025-03-08 21:57:24,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:57:24,084 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;@d65fdb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:57:24,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-08 21:57:24,090 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:57:24,090 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-08 21:57:24,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:24,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:24,091 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] [2025-03-08 21:57:24,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-03-08 21:57:24,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash -223997045, now seen corresponding path program 1 times [2025-03-08 21:57:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:24,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576716257] [2025-03-08 21:57:24,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:24,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 21:57:24,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 21:57:24,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:24,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:24,594 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:57:24,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:24,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576716257] [2025-03-08 21:57:24,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576716257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:24,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:24,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427097714] [2025-03-08 21:57:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:24,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:24,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:24,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:24,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:24,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 91 [2025-03-08 21:57:24,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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:57:24,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:24,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 91 [2025-03-08 21:57:24,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:25,171 INFO L124 PetriNetUnfolderBase]: 208/742 cut-off events. [2025-03-08 21:57:25,171 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-08 21:57:25,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 742 events. 208/742 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4682 event pairs, 46 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 1209. Up to 194 conditions per place. [2025-03-08 21:57:25,184 INFO L140 encePairwiseOnDemand]: 69/91 looper letters, 73 selfloop transitions, 42 changer transitions 0/179 dead transitions. [2025-03-08 21:57:25,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 179 transitions, 606 flow [2025-03-08 21:57:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2025-03-08 21:57:25,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9395604395604396 [2025-03-08 21:57:25,200 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 184 flow. Second operand 6 states and 513 transitions. [2025-03-08 21:57:25,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 179 transitions, 606 flow [2025-03-08 21:57:25,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 179 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:57:25,212 INFO L231 Difference]: Finished difference. Result has 104 places, 135 transitions, 498 flow [2025-03-08 21:57:25,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=104, PETRI_TRANSITIONS=135} [2025-03-08 21:57:25,217 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 8 predicate places. [2025-03-08 21:57:25,219 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 135 transitions, 498 flow [2025-03-08 21:57:25,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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:57:25,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:25,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:25,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:57:25,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-03-08 21:57:25,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:25,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1295562144, now seen corresponding path program 1 times [2025-03-08 21:57:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:25,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010673508] [2025-03-08 21:57:25,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:25,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:25,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 21:57:25,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 21:57:25,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:25,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:25,464 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:57:25,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:25,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010673508] [2025-03-08 21:57:25,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010673508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:25,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:25,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:25,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400591426] [2025-03-08 21:57:25,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:25,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:25,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:25,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:25,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:25,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 91 [2025-03-08 21:57:25,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 135 transitions, 498 flow. Second operand has 6 states, 6 states have (on average 78.33333333333333) internal successors, (470), 6 states have internal predecessors, (470), 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:57:25,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:25,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 91 [2025-03-08 21:57:25,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:25,768 INFO L124 PetriNetUnfolderBase]: 111/566 cut-off events. [2025-03-08 21:57:25,768 INFO L125 PetriNetUnfolderBase]: For 97/117 co-relation queries the response was YES. [2025-03-08 21:57:25,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 566 events. 111/566 cut-off events. For 97/117 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3678 event pairs, 30 based on Foata normal form. 3/557 useless extension candidates. Maximal degree in co-relation 1046. Up to 117 conditions per place. [2025-03-08 21:57:25,773 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 8 selfloop transitions, 5 changer transitions 0/134 dead transitions. [2025-03-08 21:57:25,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 134 transitions, 522 flow [2025-03-08 21:57:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 476 transitions. [2025-03-08 21:57:25,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2025-03-08 21:57:25,776 INFO L175 Difference]: Start difference. First operand has 104 places, 135 transitions, 498 flow. Second operand 6 states and 476 transitions. [2025-03-08 21:57:25,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 134 transitions, 522 flow [2025-03-08 21:57:25,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 134 transitions, 522 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:25,782 INFO L231 Difference]: Finished difference. Result has 108 places, 134 transitions, 506 flow [2025-03-08 21:57:25,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=506, PETRI_PLACES=108, PETRI_TRANSITIONS=134} [2025-03-08 21:57:25,782 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 12 predicate places. [2025-03-08 21:57:25,782 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 134 transitions, 506 flow [2025-03-08 21:57:25,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.33333333333333) internal successors, (470), 6 states have internal predecessors, (470), 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:57:25,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:25,783 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:57:25,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:57:25,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-03-08 21:57:25,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:25,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1438344207, now seen corresponding path program 1 times [2025-03-08 21:57:25,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:25,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791029187] [2025-03-08 21:57:25,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:25,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:25,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 21:57:25,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 21:57:25,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:25,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:26,011 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:57:26,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:26,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791029187] [2025-03-08 21:57:26,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791029187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:26,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:26,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:26,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297706474] [2025-03-08 21:57:26,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:26,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:26,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:26,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:26,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:26,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 91 [2025-03-08 21:57:26,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 134 transitions, 506 flow. Second operand has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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:57:26,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:26,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 91 [2025-03-08 21:57:26,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:26,366 INFO L124 PetriNetUnfolderBase]: 354/1090 cut-off events. [2025-03-08 21:57:26,366 INFO L125 PetriNetUnfolderBase]: For 532/565 co-relation queries the response was YES. [2025-03-08 21:57:26,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 1090 events. 354/1090 cut-off events. For 532/565 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7217 event pairs, 71 based on Foata normal form. 21/1097 useless extension candidates. Maximal degree in co-relation 2803. Up to 491 conditions per place. [2025-03-08 21:57:26,378 INFO L140 encePairwiseOnDemand]: 74/91 looper letters, 98 selfloop transitions, 53 changer transitions 0/213 dead transitions. [2025-03-08 21:57:26,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 213 transitions, 1160 flow [2025-03-08 21:57:26,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2025-03-08 21:57:26,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2025-03-08 21:57:26,380 INFO L175 Difference]: Start difference. First operand has 108 places, 134 transitions, 506 flow. Second operand 6 states and 481 transitions. [2025-03-08 21:57:26,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 213 transitions, 1160 flow [2025-03-08 21:57:26,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 213 transitions, 1150 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:57:26,403 INFO L231 Difference]: Finished difference. Result has 113 places, 187 transitions, 1012 flow [2025-03-08 21:57:26,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1012, PETRI_PLACES=113, PETRI_TRANSITIONS=187} [2025-03-08 21:57:26,406 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 17 predicate places. [2025-03-08 21:57:26,406 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 187 transitions, 1012 flow [2025-03-08 21:57:26,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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:57:26,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:26,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:26,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:57:26,407 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-03-08 21:57:26,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash 993347747, now seen corresponding path program 1 times [2025-03-08 21:57:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:26,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260681790] [2025-03-08 21:57:26,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:26,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:57:26,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:57:26,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:26,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:26,604 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:57:26,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:26,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260681790] [2025-03-08 21:57:26,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260681790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:26,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:26,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062500484] [2025-03-08 21:57:26,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:26,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:26,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:26,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:26,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:26,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 91 [2025-03-08 21:57:26,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 187 transitions, 1012 flow. Second operand has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 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:57:26,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:26,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 91 [2025-03-08 21:57:26,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:27,087 INFO L124 PetriNetUnfolderBase]: 478/1384 cut-off events. [2025-03-08 21:57:27,087 INFO L125 PetriNetUnfolderBase]: For 2078/2122 co-relation queries the response was YES. [2025-03-08 21:57:27,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4584 conditions, 1384 events. 478/1384 cut-off events. For 2078/2122 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9564 event pairs, 83 based on Foata normal form. 23/1384 useless extension candidates. Maximal degree in co-relation 4554. Up to 661 conditions per place. [2025-03-08 21:57:27,108 INFO L140 encePairwiseOnDemand]: 74/91 looper letters, 139 selfloop transitions, 68 changer transitions 0/273 dead transitions. [2025-03-08 21:57:27,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 273 transitions, 1946 flow [2025-03-08 21:57:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 477 transitions. [2025-03-08 21:57:27,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8736263736263736 [2025-03-08 21:57:27,111 INFO L175 Difference]: Start difference. First operand has 113 places, 187 transitions, 1012 flow. Second operand 6 states and 477 transitions. [2025-03-08 21:57:27,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 273 transitions, 1946 flow [2025-03-08 21:57:27,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 273 transitions, 1938 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:27,126 INFO L231 Difference]: Finished difference. Result has 123 places, 248 transitions, 1724 flow [2025-03-08 21:57:27,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1724, PETRI_PLACES=123, PETRI_TRANSITIONS=248} [2025-03-08 21:57:27,127 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 27 predicate places. [2025-03-08 21:57:27,128 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 248 transitions, 1724 flow [2025-03-08 21:57:27,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 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:57:27,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:27,128 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] [2025-03-08 21:57:27,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:57:27,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-03-08 21:57:27,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1868889250, now seen corresponding path program 1 times [2025-03-08 21:57:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:27,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590000041] [2025-03-08 21:57:27,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:27,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 21:57:27,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 21:57:27,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:27,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:27,329 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:57:27,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:27,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590000041] [2025-03-08 21:57:27,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590000041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:27,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:27,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:27,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459345482] [2025-03-08 21:57:27,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:27,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:27,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:27,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:27,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:27,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2025-03-08 21:57:27,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 248 transitions, 1724 flow. Second operand has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 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:57:27,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:27,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2025-03-08 21:57:27,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:27,684 INFO L124 PetriNetUnfolderBase]: 343/1172 cut-off events. [2025-03-08 21:57:27,684 INFO L125 PetriNetUnfolderBase]: For 2463/2515 co-relation queries the response was YES. [2025-03-08 21:57:27,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3856 conditions, 1172 events. 343/1172 cut-off events. For 2463/2515 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8424 event pairs, 29 based on Foata normal form. 15/1174 useless extension candidates. Maximal degree in co-relation 3820. Up to 284 conditions per place. [2025-03-08 21:57:27,696 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 12 selfloop transitions, 5 changer transitions 36/247 dead transitions. [2025-03-08 21:57:27,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 247 transitions, 1756 flow [2025-03-08 21:57:27,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2025-03-08 21:57:27,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8351648351648352 [2025-03-08 21:57:27,698 INFO L175 Difference]: Start difference. First operand has 123 places, 248 transitions, 1724 flow. Second operand 6 states and 456 transitions. [2025-03-08 21:57:27,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 247 transitions, 1756 flow [2025-03-08 21:57:27,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 247 transitions, 1740 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:27,711 INFO L231 Difference]: Finished difference. Result has 127 places, 211 transitions, 1420 flow [2025-03-08 21:57:27,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=1706, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1420, PETRI_PLACES=127, PETRI_TRANSITIONS=211} [2025-03-08 21:57:27,711 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 31 predicate places. [2025-03-08 21:57:27,712 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 211 transitions, 1420 flow [2025-03-08 21:57:27,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 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:57:27,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:27,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:27,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:57:27,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-03-08 21:57:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash 683876377, now seen corresponding path program 1 times [2025-03-08 21:57:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:27,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490986081] [2025-03-08 21:57:27,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:27,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:27,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 21:57:27,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 21:57:27,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:27,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:57:27,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:57:27,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 21:57:27,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 21:57:27,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:27,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:57:27,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:57:27,758 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:57:27,761 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2025-03-08 21:57:27,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-08 21:57:27,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-08 21:57:27,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 10 remaining) [2025-03-08 21:57:27,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2025-03-08 21:57:27,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-08 21:57:27,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-08 21:57:27,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-08 21:57:27,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-08 21:57:27,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-08 21:57:27,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:57:27,766 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 21:57:27,796 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:57:27,796 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:57:27,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:57:27 BasicIcfg [2025-03-08 21:57:27,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:57:27,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:57:27,805 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:57:27,805 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:57:27,806 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:23" (3/4) ... [2025-03-08 21:57:27,807 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 21:57:27,848 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-03-08 21:57:27,883 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:57:27,883 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:57:27,883 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:57:27,884 INFO L158 Benchmark]: Toolchain (without parser) took 4482.67ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 122.7MB in the beginning and 157.3MB in the end (delta: -34.6MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. [2025-03-08 21:57:27,884 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:57:27,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.97ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 104.5MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:57:27,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.21ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 103.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:57:27,884 INFO L158 Benchmark]: Boogie Preprocessor took 17.59ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 101.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:57:27,885 INFO L158 Benchmark]: IcfgBuilder took 241.93ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 87.7MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:57:27,885 INFO L158 Benchmark]: TraceAbstraction took 3869.69ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 87.7MB in the beginning and 161.9MB in the end (delta: -74.2MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. [2025-03-08 21:57:27,885 INFO L158 Benchmark]: Witness Printer took 78.65ms. Allocated memory is still 360.7MB. Free memory was 161.9MB in the beginning and 157.3MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:57:27,886 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.28ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.97ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 104.5MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.21ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 103.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.59ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 101.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 241.93ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 87.7MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3869.69ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 87.7MB in the beginning and 161.9MB in the end (delta: -74.2MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. * Witness Printer took 78.65ms. Allocated memory is still 360.7MB. Free memory was 161.9MB in the beginning and 157.3MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 684]: Data race detected Data race detected The following path leads to a data race: [L679-L682] 0 struct { int x; int y; } data; VAL [data={1:0}] [L688] 0 pthread_t id, id2; VAL [data={1:0}] [L689] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, data={1:0}, id=-1] [L684] EXPR 1 data.x VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L684] 1 data.x++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L690] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, id2=0, id=-1] [L684] EXPR 2 data.x VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L684] 2 data.x++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] Now there is a data race (on the heap) between C: data.x++ [684] and C: data.x++ [684] - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: 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: 689]: 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: 684]: 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 4 procedures, 117 locations, 115 edges, 10 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: 3.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 664 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 358 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 359 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1489 IncrementalHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 359 mSolverCounterUnsat, 9 mSDtfsCounter, 1489 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1724occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 565 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:57:27,911 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)