./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --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/systemc/mem_slave_tlm.1.cil.c -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 c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:05:48,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:05:48,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:05:48,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:05:48,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:05:48,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:05:48,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:05:48,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:05:48,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:05:48,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:05:48,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:05:48,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:05:48,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:05:48,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:05:48,809 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:05:48,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:05:48,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:05:48,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:05:48,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:05:48,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:05:48,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:05:48,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:05:48,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:05:48,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:05:48,809 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:05:48,809 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:05:48,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:05:48,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:05:48,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:05:48,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:05:48,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:05:48,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:05:48,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:05:48,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:05:48,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:05:48,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:05:48,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:05:48,810 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:05:48,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:05:48,810 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:05:48,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:05:48,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:05:48,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:05:48,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:05:48,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:05:48,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 -> c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 [2025-02-08 10:05:49,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:05:49,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:05:49,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:05:49,021 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:05:49,021 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:05:49,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2025-02-08 10:05:50,108 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f87c1b36/da134e12d58040b0b82913800df76aa9/FLAG231c94bf1 [2025-02-08 10:05:50,329 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:05:50,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2025-02-08 10:05:50,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f87c1b36/da134e12d58040b0b82913800df76aa9/FLAG231c94bf1 [2025-02-08 10:05:50,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f87c1b36/da134e12d58040b0b82913800df76aa9 [2025-02-08 10:05:50,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:05:50,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:05:50,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:05:50,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:05:50,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:05:50,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:50,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6386ba2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50, skipping insertion in model container [2025-02-08 10:05:50,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:50,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:05:50,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:05:50,919 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:05:50,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:05:50,999 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:05:51,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50 WrapperNode [2025-02-08 10:05:51,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:05:51,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:05:51,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:05:51,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:05:51,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:51,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:51,055 INFO L138 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 821 [2025-02-08 10:05:51,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:05:51,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:05:51,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:05:51,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:05:51,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:51,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:51,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:51,083 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 10:05:51,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:51,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:51,094 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:51,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:51,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:51,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:51,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:05:51,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:05:51,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:05:51,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:05:51,109 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (1/1) ... [2025-02-08 10:05:51,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:05:51,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:51,141 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 10:05:51,144 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 10:05:51,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:05:51,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:05:51,163 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-08 10:05:51,163 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-08 10:05:51,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:05:51,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:05:51,230 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:05:51,231 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:05:51,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L993: havoc s_memory_write_~i#1, s_memory_write_~v#1;havoc s_memory_write_#in~i#1, s_memory_write_#in~v#1;assume { :end_inline_s_memory_write } true;s_run_~rsp_status~1#1 := 1; [2025-02-08 10:05:51,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1325: assume 1 == ~s_run_pc~0; [2025-02-08 10:05:51,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1325: assume !(1 == ~s_run_pc~0); [2025-02-08 10:05:51,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1259: havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;start_simulation_~kernel_st~0#1 := 3; [2025-02-08 10:05:51,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1326: assume 1 == ~c_read_rsp_ev~0;~s_run_st~0 := 0; [2025-02-08 10:05:51,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1326: assume !(1 == ~c_read_rsp_ev~0); [2025-02-08 10:05:51,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L897: s_run_~req_type~1#1 := ~req_t_type___0~0;s_run_~req_a~1#1 := ~req_t_a___0~0;s_run_~req_d~1#1 := ~req_t_d___0~0;s_run_~rsp_type~1#1 := ~rsp_t_type___0~0;s_run_~rsp_status~1#1 := ~rsp_t_status___0~0;s_run_~rsp_d~1#1 := ~rsp_t_d___0~0; [2025-02-08 10:05:51,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1295: assume 5 == ~m_run_pc~0; [2025-02-08 10:05:51,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1295: assume !(5 == ~m_run_pc~0); [2025-02-08 10:05:51,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1296: assume 1 == ~c_read_req_ev~0;~m_run_st~0 := 0; [2025-02-08 10:05:51,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1296: assume !(1 == ~c_read_req_ev~0); [2025-02-08 10:05:51,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263: assume 1 == ~m_run_pc~0; [2025-02-08 10:05:51,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263: assume !(1 == ~m_run_pc~0); [2025-02-08 10:05:51,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264: assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; [2025-02-08 10:05:51,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264: assume !(1 == ~c_m_ev~0); [2025-02-08 10:05:51,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: m_run_~req_type~0#1 := ~req_t_type~0;m_run_~req_a~0#1 := ~req_t_a~0;m_run_~req_d~0#1 := ~req_t_d~0;m_run_~rsp_type~0#1 := ~rsp_t_type~0;m_run_~rsp_status~0#1 := ~rsp_t_status~0;m_run_~rsp_d~0#1 := ~rsp_t_d~0;m_run_~d~0#1 := ~d_t~0;m_run_~a~0#1 := ~a_t~0; [2025-02-08 10:05:51,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1335: assume 0 == ~m_run_st~0; [2025-02-08 10:05:51,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1335: assume !(0 == ~m_run_st~0); [2025-02-08 10:05:51,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1137: havoc m_run_~d~0#1, m_run_~a~0#1, m_run_~req_type~0#1, m_run_~req_a~0#1, m_run_~req_d~0#1, m_run_~rsp_type~0#1, m_run_~rsp_status~0#1, m_run_~rsp_d~0#1, m_run_~req_type___0~0#1, m_run_~req_a___0~0#1, m_run_~req_d___0~0#1, m_run_~rsp_type___0~0#1, m_run_~rsp_status___0~0#1, m_run_~rsp_d___0~0#1;assume { :end_inline_m_run } true; [2025-02-08 10:05:51,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1303: assume 6 == ~m_run_pc~0; [2025-02-08 10:05:51,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1303: assume !(6 == ~m_run_pc~0); [2025-02-08 10:05:51,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1304: assume 1 == ~c_write_rsp_ev~0;~m_run_st~0 := 0; [2025-02-08 10:05:51,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1304: assume !(1 == ~c_write_rsp_ev~0); [2025-02-08 10:05:51,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1271: assume 2 == ~m_run_pc~0; [2025-02-08 10:05:51,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1271: assume !(2 == ~m_run_pc~0); [2025-02-08 10:05:51,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1338: assume 0 == ~s_run_st~0; [2025-02-08 10:05:51,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1338: assume !(0 == ~s_run_st~0); [2025-02-08 10:05:51,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1272: assume 1 == ~c_read_req_ev~0;~m_run_st~0 := 0; [2025-02-08 10:05:51,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1272: assume !(1 == ~c_read_req_ev~0); [2025-02-08 10:05:51,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: m_run_~req_type___0~0#1 := ~req_tt_type~0;m_run_~req_a___0~0#1 := ~req_tt_a~0;m_run_~req_d___0~0#1 := ~req_tt_d~0;m_run_~rsp_type___0~0#1 := ~rsp_tt_type~0;m_run_~rsp_status___0~0#1 := ~rsp_tt_status~0;m_run_~rsp_d___0~0#1 := ~rsp_tt_d~0;m_run_~d~0#1 := ~d_t~0;m_run_~a~0#1 := ~a_t~0; [2025-02-08 10:05:51,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L515: m_run_~req_type___0~0#1 := ~req_tt_type~0;m_run_~req_a___0~0#1 := ~req_tt_a~0;m_run_~req_d___0~0#1 := ~req_tt_d~0;m_run_~rsp_type___0~0#1 := ~rsp_tt_type~0;m_run_~rsp_status___0~0#1 := ~rsp_tt_status~0;m_run_~rsp_d___0~0#1 := ~rsp_tt_d~0;m_run_~d~0#1 := ~d_t~0;m_run_~a~0#1 := ~a_t~0; [2025-02-08 10:05:51,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1279: assume 3 == ~m_run_pc~0; [2025-02-08 10:05:51,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1279: assume !(3 == ~m_run_pc~0); [2025-02-08 10:05:51,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1280: assume 1 == ~c_write_rsp_ev~0;~m_run_st~0 := 0; [2025-02-08 10:05:51,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1280: assume !(1 == ~c_write_rsp_ev~0); [2025-02-08 10:05:51,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019: s_run_~req_type~1#1 := ~req_t_type___0~0;s_run_~req_a~1#1 := ~req_t_a___0~0;s_run_~req_d~1#1 := ~req_t_d___0~0;s_run_~rsp_type~1#1 := ~rsp_t_type___0~0;s_run_~rsp_status~1#1 := ~rsp_t_status___0~0;s_run_~rsp_d~1#1 := ~rsp_t_d___0~0; [2025-02-08 10:05:51,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317: assume 2 == ~s_run_pc~0; [2025-02-08 10:05:51,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317: assume !(2 == ~s_run_pc~0); [2025-02-08 10:05:51,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1152: havoc s_run_#t~ret4#1, s_run_~req_type~1#1, s_run_~req_a~1#1, s_run_~req_d~1#1, s_run_~rsp_type~1#1, s_run_~rsp_status~1#1, s_run_~rsp_d~1#1, s_run_~dummy~0#1;assume { :end_inline_s_run } true; [2025-02-08 10:05:51,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: s_run_#t~ret4#1 := s_memory_read_#res#1;havoc s_memory_read_~i#1, s_memory_read_~x~0#1;havoc s_memory_read_#in~i#1;assume { :end_inline_s_memory_read } true;assume -2147483648 <= s_run_#t~ret4#1 && s_run_#t~ret4#1 <= 2147483647;s_run_~rsp_d~1#1 := s_run_#t~ret4#1;havoc s_run_#t~ret4#1;s_run_~rsp_status~1#1 := 1; [2025-02-08 10:05:51,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1318: assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; [2025-02-08 10:05:51,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1318: assume !(1 == ~c_write_req_ev~0); [2025-02-08 10:05:51,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: m_run_~req_type___0~0#1 := ~req_tt_type~0;m_run_~req_a___0~0#1 := ~req_tt_a~0;m_run_~req_d___0~0#1 := ~req_tt_d~0;m_run_~rsp_type___0~0#1 := ~rsp_tt_type~0;m_run_~rsp_status___0~0#1 := ~rsp_tt_status~0;m_run_~rsp_d___0~0#1 := ~rsp_tt_d~0;m_run_~d~0#1 := ~d_t~0;m_run_~a~0#1 := ~a_t~0; [2025-02-08 10:05:51,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1287: assume 4 == ~m_run_pc~0; [2025-02-08 10:05:51,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1287: assume !(4 == ~m_run_pc~0); [2025-02-08 10:05:51,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1288: assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; [2025-02-08 10:05:51,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1288: assume !(1 == ~c_m_ev~0); [2025-02-08 10:05:51,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L198: m_run_~req_type~0#1 := ~req_t_type~0;m_run_~req_a~0#1 := ~req_t_a~0;m_run_~req_d~0#1 := ~req_t_d~0;m_run_~rsp_type~0#1 := ~rsp_t_type~0;m_run_~rsp_status~0#1 := ~rsp_t_status~0;m_run_~rsp_d~0#1 := ~rsp_t_d~0;m_run_~a~0#1 := ~a_t~0;m_run_~d~0#1 := ~d_t~0; [2025-02-08 10:05:51,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L165: m_run_~req_type~0#1 := ~req_t_type~0;m_run_~req_a~0#1 := ~req_t_a~0;m_run_~req_d~0#1 := ~req_t_d~0;m_run_~rsp_type~0#1 := ~rsp_t_type~0;m_run_~rsp_status~0#1 := ~rsp_t_status~0;m_run_~rsp_d~0#1 := ~rsp_t_d~0;m_run_~d~0#1 := ~d_t~0;m_run_~a~0#1 := ~a_t~0; [2025-02-08 10:05:51,818 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-02-08 10:05:51,818 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:05:51,834 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:05:51,834 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:05:51,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:05:51 BoogieIcfgContainer [2025-02-08 10:05:51,834 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:05:51,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:05:51,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:05:51,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:05:51,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:05:50" (1/3) ... [2025-02-08 10:05:51,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b4b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:05:51, skipping insertion in model container [2025-02-08 10:05:51,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:50" (2/3) ... [2025-02-08 10:05:51,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b4b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:05:51, skipping insertion in model container [2025-02-08 10:05:51,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:05:51" (3/3) ... [2025-02-08 10:05:51,853 INFO L128 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2025-02-08 10:05:51,863 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:05:51,866 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mem_slave_tlm.1.cil.c that has 2 procedures, 312 locations, 1 initial locations, 13 loop locations, and 8 error locations. [2025-02-08 10:05:51,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:05:51,926 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;@1d039b10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:05:51,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 10:05:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 312 states, 215 states have (on average 1.930232558139535) internal successors, (415), 310 states have internal predecessors, (415), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 10:05:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 10:05:51,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:51,934 INFO L218 NwaCegarLoop]: trace histogram [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 10:05:51,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:05:51,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash -795213036, now seen corresponding path program 1 times [2025-02-08 10:05:51,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:51,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140272416] [2025-02-08 10:05:51,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:51,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:51,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 10:05:52,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 10:05:52,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:52,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:52,111 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 10:05:52,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:52,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140272416] [2025-02-08 10:05:52,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140272416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:52,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:52,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 10:05:52,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117730140] [2025-02-08 10:05:52,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:52,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:05:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:52,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:05:52,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:05:52,138 INFO L87 Difference]: Start difference. First operand has 312 states, 215 states have (on average 1.930232558139535) internal successors, (415), 310 states have internal predecessors, (415), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 10:05:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:52,193 INFO L93 Difference]: Finished difference Result 356 states and 487 transitions. [2025-02-08 10:05:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:05:52,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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) Word has length 22 [2025-02-08 10:05:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:52,198 INFO L225 Difference]: With dead ends: 356 [2025-02-08 10:05:52,198 INFO L226 Difference]: Without dead ends: 34 [2025-02-08 10:05:52,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:05:52,206 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:52,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 47 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:05:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-08 10:05:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-08 10:05:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 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 10:05:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-02-08 10:05:52,238 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 22 [2025-02-08 10:05:52,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:52,238 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-02-08 10:05:52,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 10:05:52,238 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-02-08 10:05:52,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 10:05:52,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:52,239 INFO L218 NwaCegarLoop]: 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] [2025-02-08 10:05:52,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:05:52,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:05:52,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:52,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2111796415, now seen corresponding path program 1 times [2025-02-08 10:05:52,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:52,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757867207] [2025-02-08 10:05:52,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:52,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:52,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 10:05:52,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 10:05:52,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:52,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:52,308 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 10:05:52,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:52,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757867207] [2025-02-08 10:05:52,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757867207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:52,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:52,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 10:05:52,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585324484] [2025-02-08 10:05:52,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:52,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:05:52,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:52,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:05:52,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:05:52,311 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 10:05:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:52,319 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2025-02-08 10:05:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:05:52,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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) Word has length 26 [2025-02-08 10:05:52,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:52,320 INFO L225 Difference]: With dead ends: 55 [2025-02-08 10:05:52,320 INFO L226 Difference]: Without dead ends: 32 [2025-02-08 10:05:52,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:05:52,322 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:52,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:05:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-08 10:05:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-08 10:05:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 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 10:05:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-02-08 10:05:52,327 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 26 [2025-02-08 10:05:52,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:52,327 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-02-08 10:05:52,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 10:05:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-02-08 10:05:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 10:05:52,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:52,329 INFO L218 NwaCegarLoop]: 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] [2025-02-08 10:05:52,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 10:05:52,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 10:05:52,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash 401901050, now seen corresponding path program 1 times [2025-02-08 10:05:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:52,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732073167] [2025-02-08 10:05:52,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:52,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:52,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 10:05:52,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 10:05:52,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:52,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:52,399 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 10:05:52,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:52,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732073167] [2025-02-08 10:05:52,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732073167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:52,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:52,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 10:05:52,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180313426] [2025-02-08 10:05:52,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:52,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:05:52,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:52,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:05:52,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:05:52,402 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 10:05:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:52,412 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-02-08 10:05:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:05:52,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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) Word has length 26 [2025-02-08 10:05:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:52,413 INFO L225 Difference]: With dead ends: 32 [2025-02-08 10:05:52,413 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 10:05:52,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:05:52,414 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:52,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:05:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 10:05:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 10:05:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 10:05:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 10:05:52,415 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2025-02-08 10:05:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:52,415 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 10:05:52,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 10:05:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 10:05:52,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 10:05:52,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 10:05:52,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 10:05:52,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 10:05:52,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 10:05:52,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 10:05:52,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 10:05:52,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 10:05:52,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 10:05:52,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 10:05:52,421 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 10:05:52,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 10:05:52,462 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 10:05:52,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 10:05:52 BoogieIcfgContainer [2025-02-08 10:05:52,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 10:05:52,478 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 10:05:52,478 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 10:05:52,478 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 10:05:52,479 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:05:51" (3/4) ... [2025-02-08 10:05:52,480 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 10:05:52,486 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure error [2025-02-08 10:05:52,498 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 10:05:52,499 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 10:05:52,499 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 10:05:52,501 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 10:05:52,620 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 10:05:52,621 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 10:05:52,621 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 10:05:52,621 INFO L158 Benchmark]: Toolchain (without parser) took 1944.75ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 52.4MB in the end (delta: 58.5MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2025-02-08 10:05:52,621 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:05:52,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.29ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 91.4MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 10:05:52,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.22ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:05:52,622 INFO L158 Benchmark]: Boogie Preprocessor took 52.08ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:05:52,622 INFO L158 Benchmark]: IcfgBuilder took 726.28ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 40.6MB in the end (delta: 45.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 10:05:52,622 INFO L158 Benchmark]: TraceAbstraction took 640.95ms. Allocated memory is still 142.6MB. Free memory was 39.8MB in the beginning and 64.8MB in the end (delta: -25.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:05:52,622 INFO L158 Benchmark]: Witness Printer took 142.75ms. Allocated memory is still 142.6MB. Free memory was 64.8MB in the beginning and 52.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:05:52,625 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.52ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.29ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 91.4MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.22ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.08ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 726.28ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 40.6MB in the end (delta: 45.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 640.95ms. Allocated memory is still 142.6MB. Free memory was 39.8MB in the beginning and 64.8MB in the end (delta: -25.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 142.75ms. Allocated memory is still 142.6MB. Free memory was 64.8MB in the beginning and 52.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 312 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 101 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 8 specifications checked. All of them hold - InvariantResult [Line: 638]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 134]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 879]: Location Invariant Derived location invariant: (m_run_pc <= 0) - InvariantResult [Line: 1255]: Location Invariant Derived location invariant: ((s_run_pc == 0) && (m_run_pc == 0)) - InvariantResult [Line: 495]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 1119]: Location Invariant Derived location invariant: ((s_run_pc == 0) && (m_run_pc == 0)) - InvariantResult [Line: 145]: Location Invariant Derived location invariant: (m_run_pc <= 0) - InvariantResult [Line: 876]: Location Invariant Derived location invariant: (m_run_pc <= 0) - InvariantResult [Line: 485]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 528]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 288]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 178]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 1001]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-02-08 10:05:52,644 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