./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/stack_longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/stack_longer-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 402cb3c5f3290109e83e598d96446a87fac59fa4aaa0b6234366e7da005f5688 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:09:11,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:09:11,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:09:11,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:09:11,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:09:11,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:09:11,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:09:11,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:09:11,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:09:11,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:09:11,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:09:11,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:09:11,925 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:09:11,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:09:11,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:09:11,925 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:09:11,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:09:11,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:09:11,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:09:11,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:09:11,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:09:11,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:09:11,926 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:09:11,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:09:11,926 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:09:11,927 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:11,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:09:11,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:09:11,927 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-jdk21/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 -> 402cb3c5f3290109e83e598d96446a87fac59fa4aaa0b6234366e7da005f5688 [2025-02-08 05:09:12,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:09:12,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:09:12,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:09:12,150 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:09:12,150 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:09:12,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longer-2.i [2025-02-08 05:09:13,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a16386bf/ab8ad56da8ce4274a41720833fca797d/FLAGdc88a10e1 [2025-02-08 05:09:13,566 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:09:13,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-2.i [2025-02-08 05:09:13,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a16386bf/ab8ad56da8ce4274a41720833fca797d/FLAGdc88a10e1 [2025-02-08 05:09:13,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a16386bf/ab8ad56da8ce4274a41720833fca797d [2025-02-08 05:09:13,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:09:13,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:09:13,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:13,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:09:13,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:09:13,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:13" (1/1) ... [2025-02-08 05:09:13,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b94df42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:13, skipping insertion in model container [2025-02-08 05:09:13,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:13" (1/1) ... [2025-02-08 05:09:13,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:09:13,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:13,989 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:09:14,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:14,098 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:09:14,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14 WrapperNode [2025-02-08 05:09:14,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:14,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:14,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:09:14,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:09:14,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14" (1/1) ... [2025-02-08 05:09:14,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14" (1/1) ... [2025-02-08 05:09:14,180 INFO L138 Inliner]: procedures = 277, calls = 431, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 577 [2025-02-08 05:09:14,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:14,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:09:14,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:09:14,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:09:14,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14" (1/1) ... [2025-02-08 05:09:14,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14" (1/1) ... [2025-02-08 05:09:14,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14" (1/1) ... [2025-02-08 05:09:14,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14" (1/1) ... [2025-02-08 05:09:14,215 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14" (1/1) ... [2025-02-08 05:09:14,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14" (1/1) ... [2025-02-08 05:09:14,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14" (1/1) ... [2025-02-08 05:09:14,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14" (1/1) ... [2025-02-08 05:09:14,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:09:14,230 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:09:14,230 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:09:14,230 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:09:14,231 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14" (1/1) ... [2025-02-08 05:09:14,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:14,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:09:14,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:09:14,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:09:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-08 05:09:14,285 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-08 05:09:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-08 05:09:14,285 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-08 05:09:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:09:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:09:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:09:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:09:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:09:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:09:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:09:14,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:09:14,287 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:09:14,389 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:09:14,390 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:09:14,939 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968-7: havoc push_#t~nondet37#1; [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968-8: SUMMARY for call write~int(push_~x#1, push_~stack#1.base, push_~stack#1.offset + 4 * push_#t~ret36#1, 4); srcloc: null [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968-9: assume { :end_inline_get_top } true;assume -2147483648 <= push_#t~ret36#1 && push_#t~ret36#1 <= 2147483647; [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968-10: push_#t~ret36#1 := get_top_#res#1; [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc inc_top_#t~post31#1, inc_top_#t~nondet32#1;assume { :end_inline_inc_top } true; [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-1: assume { :begin_inline_inc_top } true;havoc inc_top_#t~post31#1, inc_top_#t~nondet32#1; [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L998: havoc #t~ret44#1; [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L998-1: [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L998-2: SUMMARY for call #t~ret44#1 := #PthreadsMutexUnlock(~#m~0.base, ~#m~0.offset); srcloc: null [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L998-3: [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: assume false; [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: assume !false; [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20-1: assume false; [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc inc_top_#t~nondet32#1; [2025-02-08 05:09:14,940 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: assume #race~top~0 == inc_top_#t~nondet32#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: assume !(#race~top~0 == inc_top_#t~nondet32#1); [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-2: havoc inc_top_#t~post31#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-3: #race~top~0 := inc_top_#t~nondet32#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-4: havoc inc_top_#t~nondet32#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L941-1: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-5: ~top~0 := 1 + inc_top_#t~post31#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L941-2: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-6: assume 0 == #race~top~0; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-6: assume !(0 == #race~top~0); [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-7: inc_top_#t~post31#1 := ~top~0; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-8: #race~top~0 := 0; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: havoc #t~post45#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-2: ~i~0#1 := 1 + #t~post45#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-3: #t~post45#1 := ~i~0#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L971-1: push_#res#1 := 0; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: assume -1 == #t~ret43#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: assume !(-1 == #t~ret43#1); [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-1: havoc #t~ret43#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-2: havoc #t~ret43#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-3: assume { :end_inline_push } true;assume -2147483648 <= #t~ret43#1 && #t~ret43#1 <= 2147483647; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-4: havoc push_#in~stack#1.base, push_#in~stack#1.offset, push_#in~x#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-5: havoc push_#t~ret35#1, push_#t~ret36#1, push_#t~nondet37#1, push_~stack#1.base, push_~stack#1.offset, push_~x#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-6: #t~ret43#1 := push_#res#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968: havoc push_#t~nondet37#1; [2025-02-08 05:09:14,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968-1: assume ((#race[push_~stack#1.base,push_~stack#1.offset + 4 * push_#t~ret36#1] == push_#t~nondet37#1 && #race[push_~stack#1.base,1 + (push_~stack#1.offset + 4 * push_#t~ret36#1)] == push_#t~nondet37#1) && #race[push_~stack#1.base,2 + (push_~stack#1.offset + 4 * push_#t~ret36#1)] == push_#t~nondet37#1) && #race[push_~stack#1.base,3 + (push_~stack#1.offset + 4 * push_#t~ret36#1)] == push_#t~nondet37#1; [2025-02-08 05:09:14,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968-1: assume !(((#race[push_~stack#1.base,push_~stack#1.offset + 4 * push_#t~ret36#1] == push_#t~nondet37#1 && #race[push_~stack#1.base,1 + (push_~stack#1.offset + 4 * push_#t~ret36#1)] == push_#t~nondet37#1) && #race[push_~stack#1.base,2 + (push_~stack#1.offset + 4 * push_#t~ret36#1)] == push_#t~nondet37#1) && #race[push_~stack#1.base,3 + (push_~stack#1.offset + 4 * push_#t~ret36#1)] == push_#t~nondet37#1); [2025-02-08 05:09:14,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968-2: havoc push_#t~ret36#1; [2025-02-08 05:09:14,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997: assume { :end_inline_error } true; [2025-02-08 05:09:14,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968-3: #race := #race[push_~stack#1.base,3 + (push_~stack#1.offset + 4 * push_#t~ret36#1) := push_#t~nondet37#1]; [2025-02-08 05:09:14,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-1: assume { :begin_inline_error } true;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:09:14,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968-4: #race := #race[push_~stack#1.base,2 + (push_~stack#1.offset + 4 * push_#t~ret36#1) := push_#t~nondet37#1]; [2025-02-08 05:09:14,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968-5: #race := #race[push_~stack#1.base,1 + (push_~stack#1.offset + 4 * push_#t~ret36#1) := push_#t~nondet37#1]; [2025-02-08 05:09:14,942 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968-6: #race := #race[push_~stack#1.base,push_~stack#1.offset + 4 * push_#t~ret36#1 := push_#t~nondet37#1]; [2025-02-08 05:09:15,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-1: pop_#res#1 := 0; [2025-02-08 05:09:15,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010: assume -2 == #t~ret47#1; [2025-02-08 05:09:15,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010: assume !(-2 == #t~ret47#1); [2025-02-08 05:09:15,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010-1: havoc #t~ret47#1; [2025-02-08 05:09:15,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010-2: havoc #t~ret47#1; [2025-02-08 05:09:15,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010-3: assume { :end_inline_pop } true;assume -2147483648 <= #t~ret47#1 && #t~ret47#1 <= 2147483647; [2025-02-08 05:09:15,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010-4: havoc pop_#in~stack#1.base, pop_#in~stack#1.offset; [2025-02-08 05:09:15,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010-5: havoc pop_#t~ret38#1, pop_#t~ret39#1, pop_#t~mem40#1, pop_~stack#1.base, pop_~stack#1.offset; [2025-02-08 05:09:15,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010-6: #t~ret47#1 := pop_#res#1; [2025-02-08 05:09:15,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: assume false; [2025-02-08 05:09:15,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: assume !false; [2025-02-08 05:09:15,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1011: assume { :end_inline_error } true; [2025-02-08 05:09:15,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20-1: assume false; [2025-02-08 05:09:15,020 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1011-1: assume { :begin_inline_error } true;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:09:15,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L941-1: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:09:15,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L941-2: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:09:15,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc pop_#t~mem40#1; [2025-02-08 05:09:15,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc pop_#t~ret39#1; [2025-02-08 05:09:15,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-3: havoc pop_#t~mem40#1; [2025-02-08 05:09:15,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-4: havoc pop_#t~ret39#1; [2025-02-08 05:09:15,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-5: assume ((0 == #race[pop_~stack#1.base,pop_~stack#1.offset + 4 * pop_#t~ret39#1] && 0 == #race[pop_~stack#1.base,1 + (pop_~stack#1.offset + 4 * pop_#t~ret39#1)]) && 0 == #race[pop_~stack#1.base,2 + (pop_~stack#1.offset + 4 * pop_#t~ret39#1)]) && 0 == #race[pop_~stack#1.base,3 + (pop_~stack#1.offset + 4 * pop_#t~ret39#1)]; [2025-02-08 05:09:15,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-5: assume !(((0 == #race[pop_~stack#1.base,pop_~stack#1.offset + 4 * pop_#t~ret39#1] && 0 == #race[pop_~stack#1.base,1 + (pop_~stack#1.offset + 4 * pop_#t~ret39#1)]) && 0 == #race[pop_~stack#1.base,2 + (pop_~stack#1.offset + 4 * pop_#t~ret39#1)]) && 0 == #race[pop_~stack#1.base,3 + (pop_~stack#1.offset + 4 * pop_#t~ret39#1)]); [2025-02-08 05:09:15,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-6: pop_#res#1 := (if pop_#t~mem40#1 % 4294967296 % 4294967296 <= 2147483647 then pop_#t~mem40#1 % 4294967296 % 4294967296 else pop_#t~mem40#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 05:09:15,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-7: #race := #race[pop_~stack#1.base,3 + (pop_~stack#1.offset + 4 * pop_#t~ret39#1) := 0]; [2025-02-08 05:09:15,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-8: #race := #race[pop_~stack#1.base,2 + (pop_~stack#1.offset + 4 * pop_#t~ret39#1) := 0]; [2025-02-08 05:09:15,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-9: #race := #race[pop_~stack#1.base,1 + (pop_~stack#1.offset + 4 * pop_#t~ret39#1) := 0]; [2025-02-08 05:09:15,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-10: #race := #race[pop_~stack#1.base,pop_~stack#1.offset + 4 * pop_#t~ret39#1 := 0]; [2025-02-08 05:09:15,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-11: SUMMARY for call pop_#t~mem40#1 := read~int(pop_~stack#1.base, pop_~stack#1.offset + 4 * pop_#t~ret39#1, 4); srcloc: null [2025-02-08 05:09:15,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-12: assume { :end_inline_get_top } true;assume -2147483648 <= pop_#t~ret39#1 && pop_#t~ret39#1 <= 2147483647; [2025-02-08 05:09:15,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-13: pop_#t~ret39#1 := get_top_#res#1; [2025-02-08 05:09:15,026 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:09:15,026 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:09:15,052 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:09:15,055 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:09:15,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:15 BoogieIcfgContainer [2025-02-08 05:09:15,055 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:09:15,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:09:15,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:09:15,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:09:15,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:09:13" (1/3) ... [2025-02-08 05:09:15,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d409614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:15, skipping insertion in model container [2025-02-08 05:09:15,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:14" (2/3) ... [2025-02-08 05:09:15,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d409614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:15, skipping insertion in model container [2025-02-08 05:09:15,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:15" (3/3) ... [2025-02-08 05:09:15,062 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2025-02-08 05:09:15,072 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:09:15,073 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-2.i that has 3 procedures, 529 locations, 1 initial locations, 2 loop locations, and 11 error locations. [2025-02-08 05:09:15,073 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:09:15,150 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:09:15,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 535 places, 530 transitions, 1074 flow [2025-02-08 05:09:15,348 INFO L124 PetriNetUnfolderBase]: 2/528 cut-off events. [2025-02-08 05:09:15,350 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:09:15,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 528 events. 2/528 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 264 event pairs, 0 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 472. Up to 2 conditions per place. [2025-02-08 05:09:15,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 535 places, 530 transitions, 1074 flow [2025-02-08 05:09:15,365 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 528 places, 523 transitions, 1055 flow [2025-02-08 05:09:15,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:09:15,383 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;@6c058369, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:09:15,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 05:09:15,444 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:09:15,445 INFO L124 PetriNetUnfolderBase]: 0/461 cut-off events. [2025-02-08 05:09:15,445 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:09:15,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:15,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:09:15,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-08 05:09:15,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash 334676940, now seen corresponding path program 1 times [2025-02-08 05:09:15,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:15,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540109421] [2025-02-08 05:09:15,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:15,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:15,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-02-08 05:09:15,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-02-08 05:09:15,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:15,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:15,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:15,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540109421] [2025-02-08 05:09:15,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540109421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:15,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:15,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:15,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223199187] [2025-02-08 05:09:15,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:15,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:16,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:16,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:16,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 530 [2025-02-08 05:09:16,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 523 transitions, 1055 flow. Second operand has 3 states, 3 states have (on average 504.6666666666667) internal successors, (1514), 3 states have internal predecessors, (1514), 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-02-08 05:09:16,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:16,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 530 [2025-02-08 05:09:16,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:16,277 INFO L124 PetriNetUnfolderBase]: 84/879 cut-off events. [2025-02-08 05:09:16,278 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-08 05:09:16,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 879 events. 84/879 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2631 event pairs, 37 based on Foata normal form. 13/846 useless extension candidates. Maximal degree in co-relation 574. Up to 165 conditions per place. [2025-02-08 05:09:16,286 INFO L140 encePairwiseOnDemand]: 516/530 looper letters, 23 selfloop transitions, 7 changer transitions 1/528 dead transitions. [2025-02-08 05:09:16,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 528 transitions, 1133 flow [2025-02-08 05:09:16,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1548 transitions. [2025-02-08 05:09:16,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9735849056603774 [2025-02-08 05:09:16,327 INFO L175 Difference]: Start difference. First operand has 528 places, 523 transitions, 1055 flow. Second operand 3 states and 1548 transitions. [2025-02-08 05:09:16,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 528 transitions, 1133 flow [2025-02-08 05:09:16,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 528 transitions, 1125 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:09:16,345 INFO L231 Difference]: Finished difference. Result has 525 places, 523 transitions, 1092 flow [2025-02-08 05:09:16,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1092, PETRI_PLACES=525, PETRI_TRANSITIONS=523} [2025-02-08 05:09:16,350 INFO L279 CegarLoopForPetriNet]: 528 programPoint places, -3 predicate places. [2025-02-08 05:09:16,351 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 523 transitions, 1092 flow [2025-02-08 05:09:16,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 504.6666666666667) internal successors, (1514), 3 states have internal predecessors, (1514), 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-02-08 05:09:16,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:16,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:09:16,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:09:16,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-08 05:09:16,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:16,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1097275621, now seen corresponding path program 1 times [2025-02-08 05:09:16,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:16,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627009036] [2025-02-08 05:09:16,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:16,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:16,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-08 05:09:16,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-08 05:09:16,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:16,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:16,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:16,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627009036] [2025-02-08 05:09:16,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627009036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:16,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:16,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:09:16,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752883203] [2025-02-08 05:09:16,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:16,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:16,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:16,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:16,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:16,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 530 [2025-02-08 05:09:16,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 523 transitions, 1092 flow. Second operand has 3 states, 3 states have (on average 518.3333333333334) internal successors, (1555), 3 states have internal predecessors, (1555), 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-02-08 05:09:16,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:16,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 530 [2025-02-08 05:09:16,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:16,964 INFO L124 PetriNetUnfolderBase]: 17/543 cut-off events. [2025-02-08 05:09:16,964 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:09:16,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 543 events. 17/543 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 416 event pairs, 7 based on Foata normal form. 5/542 useless extension candidates. Maximal degree in co-relation 502. Up to 22 conditions per place. [2025-02-08 05:09:16,967 INFO L140 encePairwiseOnDemand]: 527/530 looper letters, 0 selfloop transitions, 0 changer transitions 486/486 dead transitions. [2025-02-08 05:09:16,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 486 transitions, 1008 flow [2025-02-08 05:09:16,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1557 transitions. [2025-02-08 05:09:16,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9792452830188679 [2025-02-08 05:09:16,972 INFO L175 Difference]: Start difference. First operand has 525 places, 523 transitions, 1092 flow. Second operand 3 states and 1557 transitions. [2025-02-08 05:09:16,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 486 transitions, 1008 flow [2025-02-08 05:09:16,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 486 transitions, 1006 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:16,976 INFO L231 Difference]: Finished difference. Result has 492 places, 0 transitions, 0 flow [2025-02-08 05:09:16,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=530, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=492, PETRI_TRANSITIONS=0} [2025-02-08 05:09:16,977 INFO L279 CegarLoopForPetriNet]: 528 programPoint places, -36 predicate places. [2025-02-08 05:09:16,977 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 0 transitions, 0 flow [2025-02-08 05:09:16,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 518.3333333333334) internal successors, (1555), 3 states have internal predecessors, (1555), 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-02-08 05:09:16,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-08 05:09:16,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 16 remaining) [2025-02-08 05:09:16,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-02-08 05:09:16,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-02-08 05:09:16,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-02-08 05:09:16,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-02-08 05:09:16,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-02-08 05:09:16,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-02-08 05:09:16,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-02-08 05:09:16,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-02-08 05:09:16,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-02-08 05:09:16,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-02-08 05:09:16,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-02-08 05:09:16,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-02-08 05:09:16,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-02-08 05:09:16,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-02-08 05:09:16,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:09:16,983 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 05:09:16,988 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:09:16,989 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:09:16,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:09:16 BasicIcfg [2025-02-08 05:09:16,994 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:09:16,995 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:09:16,995 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:09:16,995 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:09:16,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:15" (3/4) ... [2025-02-08 05:09:16,997 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:09:16,999 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-02-08 05:09:16,999 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-02-08 05:09:17,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 05:09:17,009 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:09:17,009 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:09:17,010 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:09:17,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:09:17,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:09:17,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:09:17,084 INFO L158 Benchmark]: Toolchain (without parser) took 3481.76ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 128.0MB in the beginning and 80.6MB in the end (delta: 47.4MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. [2025-02-08 05:09:17,084 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:17,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.31ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 94.3MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:09:17,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.37ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 88.7MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:09:17,084 INFO L158 Benchmark]: Boogie Preprocessor took 48.89ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 84.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:17,084 INFO L158 Benchmark]: IcfgBuilder took 825.26ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 117.9MB in the end (delta: -33.2MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-02-08 05:09:17,085 INFO L158 Benchmark]: TraceAbstraction took 1937.23ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 117.9MB in the beginning and 90.5MB in the end (delta: 27.4MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2025-02-08 05:09:17,085 INFO L158 Benchmark]: Witness Printer took 88.69ms. Allocated memory is still 218.1MB. Free memory was 90.5MB in the beginning and 80.6MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:09:17,086 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.46ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.31ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 94.3MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.37ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 88.7MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.89ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 84.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 825.26ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 117.9MB in the end (delta: -33.2MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1937.23ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 117.9MB in the beginning and 90.5MB in the end (delta: 27.4MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. * Witness Printer took 88.69ms. Allocated memory is still 218.1MB. Free memory was 90.5MB in the beginning and 80.6MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 961]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 953]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1008]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 975]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 949]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 949]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 953]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 619 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 9 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1092occurred in iteration=1, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 896 NumberOfCodeBlocks, 896 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 894 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:09:17,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Result: TRUE