./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:53:26,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:53:26,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:53:26,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:53:26,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:53:26,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:53:26,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:53:26,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:53:26,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:53:26,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:53:26,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:53:26,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:53:26,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:53:26,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:53:26,809 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:53:26,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:53:26,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:53:26,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:53:26,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:53:26,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:53:26,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:53:26,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:53:26,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:53:26,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:53:26,810 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:53:26,810 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:53:26,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:53:26,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:53:26,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:53:26,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:53:26,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:53:26,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:53:26,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:53:26,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:53:26,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:53:26,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:53:26,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:53:26,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:53:26,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:53:26,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:53:26,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:53:26,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:53:26,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:53:26,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:53:26,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:53:26,811 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 ! overflow) ) 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2025-02-08 13:53:27,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:53:27,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:53:27,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:53:27,048 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:53:27,049 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:53:27,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2025-02-08 13:53:28,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc7c1af94/2f5ccaf7d67c4ba6ae27d9f3b6b3c047/FLAGd00d11a0e [2025-02-08 13:53:28,545 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:53:28,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2025-02-08 13:53:28,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc7c1af94/2f5ccaf7d67c4ba6ae27d9f3b6b3c047/FLAGd00d11a0e [2025-02-08 13:53:28,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc7c1af94/2f5ccaf7d67c4ba6ae27d9f3b6b3c047 [2025-02-08 13:53:28,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:53:28,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:53:28,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:53:28,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:53:28,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:53:28,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:53:28" (1/1) ... [2025-02-08 13:53:28,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d4705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:28, skipping insertion in model container [2025-02-08 13:53:28,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:53:28" (1/1) ... [2025-02-08 13:53:28,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:53:29,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:53:29,089 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:53:29,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:53:29,163 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:53:29,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29 WrapperNode [2025-02-08 13:53:29,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:53:29,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:53:29,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:53:29,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:53:29,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (1/1) ... [2025-02-08 13:53:29,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (1/1) ... [2025-02-08 13:53:29,213 INFO L138 Inliner]: procedures = 277, calls = 37, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 163 [2025-02-08 13:53:29,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:53:29,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:53:29,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:53:29,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:53:29,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (1/1) ... [2025-02-08 13:53:29,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (1/1) ... [2025-02-08 13:53:29,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (1/1) ... [2025-02-08 13:53:29,241 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 1, 0]. [2025-02-08 13:53:29,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (1/1) ... [2025-02-08 13:53:29,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (1/1) ... [2025-02-08 13:53:29,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (1/1) ... [2025-02-08 13:53:29,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (1/1) ... [2025-02-08 13:53:29,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (1/1) ... [2025-02-08 13:53:29,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (1/1) ... [2025-02-08 13:53:29,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:53:29,259 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:53:29,259 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:53:29,259 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:53:29,260 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (1/1) ... [2025-02-08 13:53:29,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:53:29,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:53:29,294 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 13:53:29,297 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 13:53:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-08 13:53:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-08 13:53:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-08 13:53:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-08 13:53:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 13:53:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:53:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:53:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:53:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:53:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:53:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:53:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 13:53:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:53:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:53:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:53:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:53:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:53:29,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:53:29,318 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 13:53:29,436 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:53:29,438 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:53:29,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-4: havoc push_#in~stack#1.base, push_#in~stack#1.offset, push_#in~x#1; [2025-02-08 13:53:29,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-5: havoc push_#t~ret33#1, push_#t~ret34#1, push_~stack#1.base, push_~stack#1.offset, push_~x#1; [2025-02-08 13:53:29,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-6: #t~ret41#1 := push_#res#1; [2025-02-08 13:53:29,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc push_#t~ret34#1; [2025-02-08 13:53:29,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-1: SUMMARY for call write~int#1(push_~x#1, push_~stack#1.base, push_~stack#1.offset + 4 * push_#t~ret34#1, 4); srcloc: null [2025-02-08 13:53:29,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-2: assume { :end_inline_get_top } true;assume -2147483648 <= push_#t~ret34#1 && push_#t~ret34#1 <= 2147483647; [2025-02-08 13:53:29,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L998: assume { :end_inline_error } true; [2025-02-08 13:53:29,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-3: push_#t~ret34#1 := get_top_#res#1; [2025-02-08 13:53:29,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L998-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 13:53:29,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: assume false; [2025-02-08 13:53:29,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: assume !false; [2025-02-08 13:53:29,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20-1: assume false; [2025-02-08 13:53:29,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: assume { :end_inline_reach_error } true;assume false; [2025-02-08 13:53:29,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L941-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 13:53:29,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L970: havoc inc_top_#t~post31#1;assume { :end_inline_inc_top } true; [2025-02-08 13:53:29,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L970-1: assume { :begin_inline_inc_top } true;havoc inc_top_#t~post31#1; [2025-02-08 13:53:29,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L999: ~flag~0 := 1; [2025-02-08 13:53:29,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946: havoc inc_top_#t~post31#1; [2025-02-08 13:53:29,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-1: assume 1 + inc_top_#t~post31#1 <= 2147483647; [2025-02-08 13:53:29,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-1: assume !(1 + inc_top_#t~post31#1 <= 2147483647); [2025-02-08 13:53:29,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-2: ~top~0 := 1 + inc_top_#t~post31#1; [2025-02-08 13:53:29,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-3: assume 1 + inc_top_#t~post31#1 >= -2147483648; [2025-02-08 13:53:29,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-3: assume !(1 + inc_top_#t~post31#1 >= -2147483648); [2025-02-08 13:53:29,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-4: inc_top_#t~post31#1 := ~top~0; [2025-02-08 13:53:29,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000: havoc #t~ret42#1; [2025-02-08 13:53:29,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-1: [2025-02-08 13:53:29,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-2: SUMMARY for call #t~ret42#1 := #PthreadsMutexUnlock(~#m~0.base, ~#m~0.offset); srcloc: null [2025-02-08 13:53:29,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-3: [2025-02-08 13:53:29,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-1: havoc #t~post43#1; [2025-02-08 13:53:29,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-2: assume 1 + #t~post43#1 <= 2147483647; [2025-02-08 13:53:29,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-2: assume !(1 + #t~post43#1 <= 2147483647); [2025-02-08 13:53:29,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-3: ~i~0#1 := 1 + #t~post43#1; [2025-02-08 13:53:29,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-4: assume 1 + #t~post43#1 >= -2147483648; [2025-02-08 13:53:29,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-4: assume !(1 + #t~post43#1 >= -2147483648); [2025-02-08 13:53:29,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-5: #t~post43#1 := ~i~0#1; [2025-02-08 13:53:29,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-1: push_#res#1 := 0; [2025-02-08 13:53:29,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997: assume -1 == #t~ret41#1; [2025-02-08 13:53:29,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997: assume !(-1 == #t~ret41#1); [2025-02-08 13:53:29,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-1: havoc #t~ret41#1; [2025-02-08 13:53:29,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-2: havoc #t~ret41#1; [2025-02-08 13:53:29,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997-3: assume { :end_inline_push } true;assume -2147483648 <= #t~ret41#1 && #t~ret41#1 <= 2147483647; [2025-02-08 13:53:29,680 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0; [2025-02-08 13:53:29,680 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: assume false; [2025-02-08 13:53:29,680 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: assume !false; [2025-02-08 13:53:29,680 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20-1: assume false; [2025-02-08 13:53:29,680 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L978: havoc pop_#t~ret36#1; [2025-02-08 13:53:29,680 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L978-1: havoc pop_#t~ret36#1; [2025-02-08 13:53:29,680 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: assume { :end_inline_reach_error } true;assume false; [2025-02-08 13:53:29,680 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L941-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: get_top_#res#1 := ~top~0; [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: assume { :end_inline_dec_top } true;assume { :begin_inline_get_top } true;havoc get_top_#res#1; [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc dec_top_#t~post32#1; [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950: havoc dec_top_#t~post32#1; [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-1: assume dec_top_#t~post32#1 - 1 <= 2147483647; [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-1: assume !(dec_top_#t~post32#1 - 1 <= 2147483647); [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-2: assume { :begin_inline_dec_top } true;havoc dec_top_#t~post32#1; [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012: assume !(-2 != #t~ret45#1); [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012: assume !!(-2 != #t~ret45#1); [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-2: ~top~0 := dec_top_#t~post32#1 - 1; [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012-1: havoc #t~ret45#1; [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-3: assume dec_top_#t~post32#1 - 1 >= -2147483648; [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-3: assume !(dec_top_#t~post32#1 - 1 >= -2147483648); [2025-02-08 13:53:29,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012-2: havoc #t~ret45#1; [2025-02-08 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L979-1: pop_#res#1 := -2; [2025-02-08 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-4: dec_top_#t~post32#1 := ~top~0; [2025-02-08 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012-3: assume { :end_inline_pop } true;assume -2147483648 <= #t~ret45#1 && #t~ret45#1 <= 2147483647; [2025-02-08 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012-4: havoc pop_#in~stack#1.base, pop_#in~stack#1.offset; [2025-02-08 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012-5: havoc pop_#t~ret35#1, pop_#t~ret36#1, pop_#t~ret37#1, pop_#t~mem38#1, pop_~stack#1.base, pop_~stack#1.offset; [2025-02-08 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012-6: #t~ret45#1 := pop_#res#1; [2025-02-08 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem38#1; [2025-02-08 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret37#1; [2025-02-08 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1013: assume { :end_inline_error } true; [2025-02-08 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-3: havoc pop_#t~mem38#1; [2025-02-08 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1013-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 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-4: havoc pop_#t~ret37#1; [2025-02-08 13:53:29,682 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-5: pop_#res#1 := (if pop_#t~mem38#1 % 4294967296 % 4294967296 <= 2147483647 then pop_#t~mem38#1 % 4294967296 % 4294967296 else pop_#t~mem38#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 13:53:29,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-6: SUMMARY for call pop_#t~mem38#1 := read~int#1(pop_~stack#1.base, pop_~stack#1.offset + 4 * pop_#t~ret37#1, 4); srcloc: null [2025-02-08 13:53:29,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-7: assume { :end_inline_get_top } true;assume -2147483648 <= pop_#t~ret37#1 && pop_#t~ret37#1 <= 2147483647; [2025-02-08 13:53:29,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-8: pop_#t~ret37#1 := get_top_#res#1; [2025-02-08 13:53:29,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: assume 0 == pop_#t~ret35#1; [2025-02-08 13:53:29,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: assume !(0 == pop_#t~ret35#1); [2025-02-08 13:53:29,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-1: havoc pop_#t~ret35#1; [2025-02-08 13:53:29,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-2: havoc pop_#t~ret35#1; [2025-02-08 13:53:29,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-3: assume { :end_inline_get_top } true;assume -2147483648 <= pop_#t~ret35#1 && pop_#t~ret35#1 <= 2147483647; [2025-02-08 13:53:29,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-4: pop_#t~ret35#1 := get_top_#res#1; [2025-02-08 13:53:29,684 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 13:53:29,684 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:53:29,772 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:53:29,772 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:53:29,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:29 BoogieIcfgContainer [2025-02-08 13:53:29,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:53:29,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:53:29,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:53:29,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:53:29,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:53:28" (1/3) ... [2025-02-08 13:53:29,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ce548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:53:29, skipping insertion in model container [2025-02-08 13:53:29,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:29" (2/3) ... [2025-02-08 13:53:29,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ce548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:53:29, skipping insertion in model container [2025-02-08 13:53:29,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:29" (3/3) ... [2025-02-08 13:53:29,781 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-2.i [2025-02-08 13:53:29,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:53:29,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-2.i that has 3 procedures, 30 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-02-08 13:53:29,794 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 13:53:29,863 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 13:53:29,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 74 flow [2025-02-08 13:53:29,899 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2025-02-08 13:53:29,901 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 13:53:29,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 1/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-02-08 13:53:29,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 30 transitions, 74 flow [2025-02-08 13:53:29,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 24 transitions, 57 flow [2025-02-08 13:53:29,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:53:29,916 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;@63594b83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:53:29,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 13:53:29,922 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:53:29,922 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-08 13:53:29,922 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 13:53:29,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:29,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:29,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 13:53:29,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2110598031, now seen corresponding path program 1 times [2025-02-08 13:53:29,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:29,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39275204] [2025-02-08 13:53:29,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:29,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:29,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:53:30,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:53:30,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:30,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:30,139 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 13:53:30,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:30,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39275204] [2025-02-08 13:53:30,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39275204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:30,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:53:30,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218647737] [2025-02-08 13:53:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:30,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:53:30,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:30,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:53:30,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:53:30,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-02-08 13:53:30,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 13:53:30,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:30,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-02-08 13:53:30,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:30,318 INFO L124 PetriNetUnfolderBase]: 233/513 cut-off events. [2025-02-08 13:53:30,318 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 13:53:30,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 513 events. 233/513 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2181 event pairs, 138 based on Foata normal form. 15/479 useless extension candidates. Maximal degree in co-relation 887. Up to 274 conditions per place. [2025-02-08 13:53:30,323 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 36 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-02-08 13:53:30,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 181 flow [2025-02-08 13:53:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:53:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:53:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-02-08 13:53:30,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-02-08 13:53:30,333 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 57 flow. Second operand 4 states and 69 transitions. [2025-02-08 13:53:30,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 181 flow [2025-02-08 13:53:30,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 13:53:30,337 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 74 flow [2025-02-08 13:53:30,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2025-02-08 13:53:30,341 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2025-02-08 13:53:30,341 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 74 flow [2025-02-08 13:53:30,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 13:53:30,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:30,342 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:30,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:53:30,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 13:53:30,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1597006520, now seen corresponding path program 1 times [2025-02-08 13:53:30,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:30,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226967640] [2025-02-08 13:53:30,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:30,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:30,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 13:53:30,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 13:53:30,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:30,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226967640] [2025-02-08 13:53:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226967640] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:53:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224914485] [2025-02-08 13:53:30,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:30,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:53:30,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:53:30,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:53:30,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:53:30,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 13:53:30,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 13:53:30,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:30,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:30,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:53:30,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:53:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:53:30,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:53:30,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224914485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:30,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:53:30,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-08 13:53:30,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676745779] [2025-02-08 13:53:30,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:30,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:53:30,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:30,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:53:30,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:53:30,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-02-08 13:53:30,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 13:53:30,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:30,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-02-08 13:53:30,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:30,795 INFO L124 PetriNetUnfolderBase]: 253/539 cut-off events. [2025-02-08 13:53:30,796 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-02-08 13:53:30,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 539 events. 253/539 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2173 event pairs, 18 based on Foata normal form. 15/512 useless extension candidates. Maximal degree in co-relation 544. Up to 225 conditions per place. [2025-02-08 13:53:30,800 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 32 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2025-02-08 13:53:30,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 178 flow [2025-02-08 13:53:30,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:53:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:53:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-08 13:53:30,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 13:53:30,805 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 74 flow. Second operand 4 states and 60 transitions. [2025-02-08 13:53:30,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 178 flow [2025-02-08 13:53:30,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 13:53:30,807 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 78 flow [2025-02-08 13:53:30,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2025-02-08 13:53:30,808 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-02-08 13:53:30,808 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 78 flow [2025-02-08 13:53:30,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 13:53:30,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:53:30,809 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:53:30,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:53:31,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:53:31,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 13:53:31,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:53:31,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2032405734, now seen corresponding path program 1 times [2025-02-08 13:53:31,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:53:31,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66706785] [2025-02-08 13:53:31,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:53:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:53:31,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 13:53:31,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 13:53:31,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:53:31,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:53:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:53:31,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:53:31,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66706785] [2025-02-08 13:53:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66706785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:53:31,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:53:31,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:53:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462832735] [2025-02-08 13:53:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:53:31,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:53:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:53:31,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:53:31,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:53:31,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-02-08 13:53:31,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 13:53:31,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:53:31,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-02-08 13:53:31,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:53:31,205 INFO L124 PetriNetUnfolderBase]: 233/504 cut-off events. [2025-02-08 13:53:31,205 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2025-02-08 13:53:31,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 504 events. 233/504 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2087 event pairs, 38 based on Foata normal form. 15/494 useless extension candidates. Maximal degree in co-relation 532. Up to 245 conditions per place. [2025-02-08 13:53:31,207 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 0 selfloop transitions, 0 changer transitions 41/41 dead transitions. [2025-02-08 13:53:31,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 184 flow [2025-02-08 13:53:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:53:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:53:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-08 13:53:31,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 13:53:31,208 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 78 flow. Second operand 4 states and 60 transitions. [2025-02-08 13:53:31,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 184 flow [2025-02-08 13:53:31,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 13:53:31,211 INFO L231 Difference]: Finished difference. Result has 32 places, 0 transitions, 0 flow [2025-02-08 13:53:31,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=32, PETRI_TRANSITIONS=0} [2025-02-08 13:53:31,212 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2025-02-08 13:53:31,212 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 0 transitions, 0 flow [2025-02-08 13:53:31,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 13:53:31,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-08 13:53:31,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-02-08 13:53:31,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 13:53:31,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 13:53:31,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 13:53:31,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-08 13:53:31,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:53:31,215 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 13:53:31,218 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 13:53:31,218 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 13:53:31,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:53:31 BasicIcfg [2025-02-08 13:53:31,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 13:53:31,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 13:53:31,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 13:53:31,222 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 13:53:31,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:29" (3/4) ... [2025-02-08 13:53:31,224 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 13:53:31,225 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-02-08 13:53:31,226 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-02-08 13:53:31,227 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-02-08 13:53:31,228 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 13:53:31,228 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-08 13:53:31,228 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 13:53:31,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 13:53:31,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 13:53:31,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 13:53:31,273 INFO L158 Benchmark]: Toolchain (without parser) took 2534.29ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 45.5MB in the end (delta: 59.4MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2025-02-08 13:53:31,273 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:53:31,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.38ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 75.4MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 13:53:31,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.98ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 73.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:53:31,273 INFO L158 Benchmark]: Boogie Preprocessor took 42.41ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 71.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:53:31,274 INFO L158 Benchmark]: IcfgBuilder took 513.82ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 39.6MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 13:53:31,274 INFO L158 Benchmark]: TraceAbstraction took 1447.68ms. Allocated memory is still 142.6MB. Free memory was 39.1MB in the beginning and 50.9MB in the end (delta: -11.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:53:31,274 INFO L158 Benchmark]: Witness Printer took 50.30ms. Allocated memory is still 142.6MB. Free memory was 50.9MB in the beginning and 45.5MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:53:31,275 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.51ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.38ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 75.4MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.98ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 73.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.41ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 71.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 513.82ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 39.6MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1447.68ms. Allocated memory is still 142.6MB. Free memory was 39.1MB in the beginning and 50.9MB in the end (delta: -11.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 50.30ms. Allocated memory is still 142.6MB. Free memory was 50.9MB in the beginning and 45.5MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1007]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1007]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 262 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 10 mSDtfsCounter, 262 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=2, InterpolantAutomatonStates: 12, 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.4s InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 159 SizeOfPredicates, 1 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 15/22 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 13:53:31,290 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