./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_14-idxunknown_access.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_14-idxunknown_access.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 ab624cd95d0fa2367e02c67b22b0f1efd275cc176f54b50b7fb2d138f7f4319c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:31,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:31,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:26:31,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:31,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:31,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:31,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:31,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:31,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:31,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:31,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:31,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:31,661 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:31,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:31,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:31,661 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:31,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:31,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:31,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:31,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:31,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:31,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:31,662 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:31,662 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:31,662 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:31,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:31,662 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:31,662 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:31,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:31,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:31,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:31,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:31,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:31,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:31,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:31,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:31,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:31,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:31,663 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:31,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:31,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:31,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:31,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:31,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:31,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:31,664 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 -> ab624cd95d0fa2367e02c67b22b0f1efd275cc176f54b50b7fb2d138f7f4319c [2025-04-30 10:26:31,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:31,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:31,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:31,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:31,897 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:31,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_14-idxunknown_access.i [2025-04-30 10:26:33,184 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f877ab230/0a32ca283c3a44a788aa98954e0dca6e/FLAG9047d2995 [2025-04-30 10:26:33,441 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:33,441 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/05-lval_ls_14-idxunknown_access.i [2025-04-30 10:26:33,449 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f877ab230/0a32ca283c3a44a788aa98954e0dca6e/FLAG9047d2995 [2025-04-30 10:26:34,233 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f877ab230/0a32ca283c3a44a788aa98954e0dca6e [2025-04-30 10:26:34,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:34,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:34,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:34,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:34,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:34,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d71e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34, skipping insertion in model container [2025-04-30 10:26:34,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:34,548 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:34,556 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:34,609 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:34,632 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:34,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34 WrapperNode [2025-04-30 10:26:34,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:34,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:34,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:34,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:34,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,672 INFO L138 Inliner]: procedures = 163, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2025-04-30 10:26:34,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:34,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:34,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:34,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:34,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,687 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:34,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:34,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:34,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:34,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (1/1) ... [2025-04-30 10:26:34,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:34,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:34,721 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-04-30 10:26:34,723 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-04-30 10:26:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:26:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:26:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:34,742 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:34,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:34,742 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:26:34,823 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:34,824 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:34,998 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:34,999 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:35,005 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:35,009 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:35,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:35 BoogieIcfgContainer [2025-04-30 10:26:35,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:35,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:35,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:35,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:35,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:34" (1/3) ... [2025-04-30 10:26:35,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de92198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:35, skipping insertion in model container [2025-04-30 10:26:35,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:34" (2/3) ... [2025-04-30 10:26:35,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de92198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:35, skipping insertion in model container [2025-04-30 10:26:35,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:35" (3/3) ... [2025-04-30 10:26:35,017 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_14-idxunknown_access.i [2025-04-30 10:26:35,026 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:35,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_14-idxunknown_access.i that has 2 procedures, 81 locations, 80 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-30 10:26:35,028 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:35,084 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:26:35,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 81 transitions, 166 flow [2025-04-30 10:26:35,145 INFO L116 PetriNetUnfolderBase]: 1/80 cut-off events. [2025-04-30 10:26:35,148 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:35,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 80 events. 1/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-04-30 10:26:35,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 81 transitions, 166 flow [2025-04-30 10:26:35,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 80 transitions, 163 flow [2025-04-30 10:26:35,163 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:35,171 INFO L340 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;@334f0434, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:35,172 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-30 10:26:35,180 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:35,180 INFO L116 PetriNetUnfolderBase]: 1/45 cut-off events. [2025-04-30 10:26:35,180 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:35,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:35,181 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-04-30 10:26:35,182 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:35,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:35,186 INFO L85 PathProgramCache]: Analyzing trace with hash -427779772, now seen corresponding path program 1 times [2025-04-30 10:26:35,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:35,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828490283] [2025-04-30 10:26:35,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:35,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:26:35,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:26:35,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:35,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:35,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:35,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828490283] [2025-04-30 10:26:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828490283] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:35,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:35,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:35,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275874732] [2025-04-30 10:26:35,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:35,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:35,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:35,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:35,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:36,089 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 81 [2025-04-30 10:26:36,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 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-04-30 10:26:36,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:36,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 81 [2025-04-30 10:26:36,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:36,236 INFO L116 PetriNetUnfolderBase]: 72/440 cut-off events. [2025-04-30 10:26:36,240 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:36,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 440 events. 72/440 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2535 event pairs, 26 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 584. Up to 101 conditions per place. [2025-04-30 10:26:36,243 INFO L140 encePairwiseOnDemand]: 69/81 looper letters, 28 selfloop transitions, 22 changer transitions 1/112 dead transitions. [2025-04-30 10:26:36,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 112 transitions, 327 flow [2025-04-30 10:26:36,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:36,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 430 transitions. [2025-04-30 10:26:36,257 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8847736625514403 [2025-04-30 10:26:36,260 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 163 flow. Second operand 6 states and 430 transitions. [2025-04-30 10:26:36,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 112 transitions, 327 flow [2025-04-30 10:26:36,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:36,268 INFO L231 Difference]: Finished difference. Result has 91 places, 100 transitions, 304 flow [2025-04-30 10:26:36,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=91, PETRI_TRANSITIONS=100} [2025-04-30 10:26:36,272 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 8 predicate places. [2025-04-30 10:26:36,273 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 304 flow [2025-04-30 10:26:36,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 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-04-30 10:26:36,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:36,273 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] [2025-04-30 10:26:36,273 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:26:36,273 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:36,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:36,274 INFO L85 PathProgramCache]: Analyzing trace with hash 64161900, now seen corresponding path program 1 times [2025-04-30 10:26:36,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:36,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368950800] [2025-04-30 10:26:36,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:36,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:36,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:26:36,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:26:36,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:36,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:36,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:36,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368950800] [2025-04-30 10:26:36,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368950800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:36,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:36,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:36,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743863671] [2025-04-30 10:26:36,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:36,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:36,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:36,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:36,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:36,687 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2025-04-30 10:26:36,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 100 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 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-04-30 10:26:36,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:36,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2025-04-30 10:26:36,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:36,802 INFO L116 PetriNetUnfolderBase]: 118/628 cut-off events. [2025-04-30 10:26:36,802 INFO L117 PetriNetUnfolderBase]: For 99/109 co-relation queries the response was YES. [2025-04-30 10:26:36,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 628 events. 118/628 cut-off events. For 99/109 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4309 event pairs, 29 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 1099. Up to 204 conditions per place. [2025-04-30 10:26:36,808 INFO L140 encePairwiseOnDemand]: 70/81 looper letters, 42 selfloop transitions, 26 changer transitions 0/133 dead transitions. [2025-04-30 10:26:36,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 526 flow [2025-04-30 10:26:36,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2025-04-30 10:26:36,812 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2025-04-30 10:26:36,813 INFO L175 Difference]: Start difference. First operand has 91 places, 100 transitions, 304 flow. Second operand 6 states and 414 transitions. [2025-04-30 10:26:36,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 526 flow [2025-04-30 10:26:36,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 133 transitions, 526 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:36,817 INFO L231 Difference]: Finished difference. Result has 99 places, 122 transitions, 482 flow [2025-04-30 10:26:36,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=99, PETRI_TRANSITIONS=122} [2025-04-30 10:26:36,818 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 16 predicate places. [2025-04-30 10:26:36,819 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 122 transitions, 482 flow [2025-04-30 10:26:36,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 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-04-30 10:26:36,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:36,819 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] [2025-04-30 10:26:36,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:26:36,819 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:36,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1042240329, now seen corresponding path program 1 times [2025-04-30 10:26:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:36,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517231982] [2025-04-30 10:26:36,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:36,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:26:36,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:26:36,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:36,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:37,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:37,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517231982] [2025-04-30 10:26:37,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517231982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:37,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:37,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:37,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912783096] [2025-04-30 10:26:37,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:37,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:37,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:37,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:37,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:37,185 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 81 [2025-04-30 10:26:37,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 122 transitions, 482 flow. Second operand has 6 states, 6 states have (on average 59.166666666666664) internal successors, (355), 6 states have internal predecessors, (355), 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-04-30 10:26:37,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:37,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 81 [2025-04-30 10:26:37,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:37,444 INFO L116 PetriNetUnfolderBase]: 294/1259 cut-off events. [2025-04-30 10:26:37,444 INFO L117 PetriNetUnfolderBase]: For 655/693 co-relation queries the response was YES. [2025-04-30 10:26:37,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2803 conditions, 1259 events. 294/1259 cut-off events. For 655/693 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9666 event pairs, 65 based on Foata normal form. 16/1187 useless extension candidates. Maximal degree in co-relation 2756. Up to 426 conditions per place. [2025-04-30 10:26:37,454 INFO L140 encePairwiseOnDemand]: 66/81 looper letters, 78 selfloop transitions, 59 changer transitions 0/196 dead transitions. [2025-04-30 10:26:37,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 196 transitions, 1117 flow [2025-04-30 10:26:37,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 415 transitions. [2025-04-30 10:26:37,456 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8539094650205762 [2025-04-30 10:26:37,456 INFO L175 Difference]: Start difference. First operand has 99 places, 122 transitions, 482 flow. Second operand 6 states and 415 transitions. [2025-04-30 10:26:37,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 196 transitions, 1117 flow [2025-04-30 10:26:37,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 196 transitions, 1117 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:37,467 INFO L231 Difference]: Finished difference. Result has 108 places, 174 transitions, 1000 flow [2025-04-30 10:26:37,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1000, PETRI_PLACES=108, PETRI_TRANSITIONS=174} [2025-04-30 10:26:37,468 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 25 predicate places. [2025-04-30 10:26:37,468 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 174 transitions, 1000 flow [2025-04-30 10:26:37,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.166666666666664) internal successors, (355), 6 states have internal predecessors, (355), 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-04-30 10:26:37,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:37,470 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] [2025-04-30 10:26:37,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:26:37,470 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:37,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1819396421, now seen corresponding path program 1 times [2025-04-30 10:26:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:37,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268605690] [2025-04-30 10:26:37,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:37,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:26:37,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:26:37,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:37,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:37,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:37,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268605690] [2025-04-30 10:26:37,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268605690] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:37,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:37,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:37,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958387424] [2025-04-30 10:26:37,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:37,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:37,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:37,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:37,918 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 81 [2025-04-30 10:26:37,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 174 transitions, 1000 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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-04-30 10:26:37,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:37,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 81 [2025-04-30 10:26:37,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:38,217 INFO L116 PetriNetUnfolderBase]: 482/1724 cut-off events. [2025-04-30 10:26:38,217 INFO L117 PetriNetUnfolderBase]: For 2241/2293 co-relation queries the response was YES. [2025-04-30 10:26:38,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4963 conditions, 1724 events. 482/1724 cut-off events. For 2241/2293 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13875 event pairs, 89 based on Foata normal form. 14/1667 useless extension candidates. Maximal degree in co-relation 4909. Up to 681 conditions per place. [2025-04-30 10:26:38,229 INFO L140 encePairwiseOnDemand]: 66/81 looper letters, 109 selfloop transitions, 77 changer transitions 11/260 dead transitions. [2025-04-30 10:26:38,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 260 transitions, 1922 flow [2025-04-30 10:26:38,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 400 transitions. [2025-04-30 10:26:38,231 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.823045267489712 [2025-04-30 10:26:38,231 INFO L175 Difference]: Start difference. First operand has 108 places, 174 transitions, 1000 flow. Second operand 6 states and 400 transitions. [2025-04-30 10:26:38,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 260 transitions, 1922 flow [2025-04-30 10:26:38,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 260 transitions, 1854 flow, removed 34 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:38,276 INFO L231 Difference]: Finished difference. Result has 117 places, 224 transitions, 1568 flow [2025-04-30 10:26:38,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1568, PETRI_PLACES=117, PETRI_TRANSITIONS=224} [2025-04-30 10:26:38,277 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 34 predicate places. [2025-04-30 10:26:38,277 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 224 transitions, 1568 flow [2025-04-30 10:26:38,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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-04-30 10:26:38,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:38,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:38,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:26:38,279 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:38,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:38,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1653621330, now seen corresponding path program 1 times [2025-04-30 10:26:38,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:38,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366869143] [2025-04-30 10:26:38,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:38,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:38,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:26:38,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:26:38,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:38,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:38,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:26:38,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:26:38,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:26:38,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:38,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:38,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:26:38,337 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:26:38,339 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-04-30 10:26:38,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-30 10:26:38,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-30 10:26:38,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-30 10:26:38,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-30 10:26:38,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-30 10:26:38,340 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-30 10:26:38,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:26:38,341 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-30 10:26:38,373 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:26:38,374 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:26:38,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:26:38 BasicIcfg [2025-04-30 10:26:38,377 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:26:38,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:26:38,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:26:38,378 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:26:38,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:35" (3/4) ... [2025-04-30 10:26:38,379 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:26:38,417 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 4. [2025-04-30 10:26:38,443 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:26:38,443 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:26:38,443 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:26:38,444 INFO L158 Benchmark]: Toolchain (without parser) took 4208.42ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 122.4MB in the beginning and 304.8MB in the end (delta: -182.4MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2025-04-30 10:26:38,444 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:38,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.15ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 100.4MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:26:38,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.63ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:38,445 INFO L158 Benchmark]: Boogie Preprocessor took 24.21ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 97.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:38,445 INFO L158 Benchmark]: RCFGBuilder took 311.74ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 82.6MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:26:38,445 INFO L158 Benchmark]: TraceAbstraction took 3366.90ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 81.5MB in the beginning and 313.2MB in the end (delta: -231.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:38,445 INFO L158 Benchmark]: Witness Printer took 65.80ms. Allocated memory is still 377.5MB. Free memory was 313.2MB in the beginning and 304.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:26:38,446 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.27ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.15ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 100.4MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.63ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.21ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 97.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 311.74ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 82.6MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3366.90ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 81.5MB in the beginning and 313.2MB in the end (delta: -231.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 65.80ms. Allocated memory is still 377.5MB. Free memory was 313.2MB in the beginning and 304.8MB 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: 694]: Data race detected Data race detected The following path leads to a data race: [L684] 0 int data[10]; VAL [data={1:0}] [L690] 0 int i = __VERIFIER_nondet_int(); VAL [data={1:0}, i=4] [L691] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, cond=1, data={1:0}] [L691] RET 0 assume_abort_if_not(0 <= i && i < 10) [L692] 0 pthread_t id; VAL [data={1:0}, i=4] [L693] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\at(arg, Pre)={0:0}, data={1:0}, i=4, id=-1] [L694] EXPR 0 data[i] VAL [\at(arg, Pre)={0:0}, data={1:0}, i=4, id=-1] [L694] 0 data[i]++ VAL [\at(arg, Pre)={0:0}, data={1:0}, i=4, id=-1] [L686] EXPR 1 data[4] VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}] [L686] 1 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}] [L694] 0 data[i]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, i=4, id=-1] [L686] 1 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}] [L694] 0 data[i]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, i=4, id=-1] [L686] 1 data[4]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}] [L694] 0 data[i]++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, i=4, id=-1] Now there is a data race (on the heap) between C: data[4]++ [686] and C: data[i]++ [694] - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: 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: 686]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 686]: 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, 105 locations, 104 edges, 7 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.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 997 IncrementalHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 5 mSDtfsCounter, 997 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1568occurred in iteration=4, InterpolantAutomatonStates: 24, 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, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-04-30 10:26:38,462 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)