./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination 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/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:39:25,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:39:25,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:39:25,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:39:25,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:39:25,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:39:25,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:39:25,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:39:25,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:39:25,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:39:25,155 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:39:25,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:39:25,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:39:25,156 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:39:25,156 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:39:25,156 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:39:25,156 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:39:25,156 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:39:25,156 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:39:25,156 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:39:25,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:39:25,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:39:25,157 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:39:25,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:39:25,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:39:25,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:39:25,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:39:25,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:39:25,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:39:25,157 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:39:25,157 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:39:25,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:39:25,157 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:39:25,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:39:25,158 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:39:25,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:39:25,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:39:25,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:39:25,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:39:25,158 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:39:25,158 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 [2025-02-08 14:39:25,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:39:25,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:39:25,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:39:25,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:39:25,513 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:39:25,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2025-02-08 14:39:26,711 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34bfc69c0/5273c03900854edca885bc8cfb64bdc5/FLAGd104d2d44 [2025-02-08 14:39:26,953 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:39:26,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2025-02-08 14:39:26,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34bfc69c0/5273c03900854edca885bc8cfb64bdc5/FLAGd104d2d44 [2025-02-08 14:39:27,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34bfc69c0/5273c03900854edca885bc8cfb64bdc5 [2025-02-08 14:39:27,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:39:27,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:39:27,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:39:27,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:39:27,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:39:27,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f4a2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27, skipping insertion in model container [2025-02-08 14:39:27,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:39:27,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:39:27,418 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:39:27,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:39:27,438 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:39:27,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27 WrapperNode [2025-02-08 14:39:27,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:39:27,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:39:27,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:39:27,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:39:27,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,465 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 19, calls inlined = 34, statements flattened = 200 [2025-02-08 14:39:27,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:39:27,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:39:27,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:39:27,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:39:27,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,490 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 14:39:27,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:39:27,506 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:39:27,506 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:39:27,506 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:39:27,511 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (1/1) ... [2025-02-08 14:39:27,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:39:27,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:39:27,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:39:27,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:39:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:39:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:39:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:39:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:39:27,592 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:39:27,593 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:39:27,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; [2025-02-08 14:39:27,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-2: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-3: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,813 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-4: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-5: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-6: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-7: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-8: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-9: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-10: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-12: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-13: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,814 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L19-14: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false;assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false;assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-2: assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-2: assume !false;assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-3: assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-3: assume !false;assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-4: assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-4: assume !false;assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-5: assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-5: assume !false;assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-6: assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-6: assume !false;assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-7: assume false; [2025-02-08 14:39:27,815 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-7: assume !false;assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-8: assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-8: assume !false;assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-9: assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-9: assume !false;assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-10: assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-10: assume !false;assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-12: assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-12: assume !false;assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-13: assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-13: assume !false;assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-14: assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-14: assume !false;assume false; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~nondet3#1; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 < main_~bufsize~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L39-1: assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L39-1: assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < main_~len~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,816 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,817 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,817 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 < main_~bufsize~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,817 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L41: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 < main_~bufsize~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,817 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 < main_~bufsize~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,817 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,818 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,818 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,818 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,818 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-1: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,818 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-1: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,818 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-2: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,818 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-2: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,818 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-3: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,818 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-3: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,819 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-4: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,819 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-4: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,819 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-5: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,819 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-5: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,819 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-6: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,819 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-6: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,819 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 < main_~len~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-08 14:39:27,819 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-7: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,819 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-7: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,819 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-8: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,820 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-8: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,820 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-9: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,820 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-9: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,820 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-10: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,820 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-10: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,820 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-12: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,820 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-12: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,820 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-13: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,820 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-13: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,820 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-14: assume 0 == __VERIFIER_assert_~cond#1;assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 14:39:27,821 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18-14: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-08 14:39:27,825 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-08 14:39:27,826 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:39:27,832 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:39:27,832 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:39:27,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:39:27 BoogieIcfgContainer [2025-02-08 14:39:27,833 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:39:27,834 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:39:27,834 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:39:27,838 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:39:27,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:39:27,839 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:39:27" (1/3) ... [2025-02-08 14:39:27,839 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fdee665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:39:27, skipping insertion in model container [2025-02-08 14:39:27,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:39:27,840 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:39:27" (2/3) ... [2025-02-08 14:39:27,840 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fdee665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:39:27, skipping insertion in model container [2025-02-08 14:39:27,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:39:27,840 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:39:27" (3/3) ... [2025-02-08 14:39:27,841 INFO L363 chiAutomizerObserver]: Analyzing ICFG SpamAssassin-loop.i [2025-02-08 14:39:27,871 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:39:27,872 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:39:27,872 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:39:27,872 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:39:27,872 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:39:27,872 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:39:27,872 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:39:27,872 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:39:27,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 15 states have internal predecessors, (20), 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 14:39:27,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:39:27,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:39:27,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:39:27,890 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:39:27,890 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:39:27,891 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:39:27,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 15 states have internal predecessors, (20), 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 14:39:27,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:39:27,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:39:27,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:39:27,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:39:27,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:39:27,895 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~len~0#1, main_~i~0#1, main_~j~0#1, main_~bufsize~0#1, main_~limit~0#1;havoc main_~len~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~bufsize~0#1;havoc main_#t~nondet1#1;main_~bufsize~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !(main_~bufsize~0#1 < 0);havoc main_#t~nondet2#1;main_~len~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~limit~0#1 := main_~bufsize~0#1 - 4;main_~i~0#1 := 0;" [2025-02-08 14:39:27,896 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~len~0#1;main_~j~0#1 := 0;" "assume !(main_~i~0#1 < main_~len~0#1 && main_~j~0#1 < main_~limit~0#1);" [2025-02-08 14:39:27,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:39:27,900 INFO L85 PathProgramCache]: Analyzing trace with hash 5056, now seen corresponding path program 1 times [2025-02-08 14:39:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:39:27,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888076324] [2025-02-08 14:39:27,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:39:27,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:39:27,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:39:27,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:39:27,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:39:27,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:39:27,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:39:27,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:39:27,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:39:27,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:39:27,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:39:27,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:39:27,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:39:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash 4864, now seen corresponding path program 1 times [2025-02-08 14:39:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:39:27,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861276851] [2025-02-08 14:39:27,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:39:27,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:39:27,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:39:27,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:39:27,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:39:27,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:39:27,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:39:28,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:39:28,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:39:28,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:39:28,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:39:28,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:39:28,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:39:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash 4862719, now seen corresponding path program 1 times [2025-02-08 14:39:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:39:28,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199968199] [2025-02-08 14:39:28,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:39:28,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:39:28,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:39:28,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:39:28,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:39:28,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:39:28,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:39:28,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:39:28,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:39:28,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:39:28,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:39:28,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:39:28,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:39:28,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:39:28,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:39:28,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:39:28,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:39:28,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:39:28,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:39:28,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:39:28,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:39:28,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:39:28 BoogieIcfgContainer [2025-02-08 14:39:28,239 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:39:28,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:39:28,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:39:28,240 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:39:28,243 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:39:27" (3/4) ... [2025-02-08 14:39:28,245 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-08 14:39:28,273 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:39:28,273 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:39:28,274 INFO L158 Benchmark]: Toolchain (without parser) took 973.93ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 51.7MB in the end (delta: 55.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 14:39:28,274 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:39:28,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 137.72ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 96.3MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:39:28,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.66ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 94.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:39:28,275 INFO L158 Benchmark]: Boogie Preprocessor took 37.89ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.9MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:39:28,275 INFO L158 Benchmark]: IcfgBuilder took 326.78ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 77.4MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:39:28,275 INFO L158 Benchmark]: BuchiAutomizer took 405.81ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 54.8MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 14:39:28,275 INFO L158 Benchmark]: Witness Printer took 33.25ms. Allocated memory is still 142.6MB. Free memory was 54.8MB in the beginning and 51.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:39:28,280 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.20ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 137.72ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 96.3MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.66ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 94.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.89ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.9MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 326.78ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 77.4MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 405.81ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 54.8MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 33.25ms. Allocated memory is still 142.6MB. Free memory was 54.8MB in the beginning and 51.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.3s and 1 iterations. TraceHistogramMax:1. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 34]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L26] int len; [L27] int i; [L28] int j; [L29] int bufsize; [L30] bufsize = __VERIFIER_nondet_int() [L31] COND FALSE !(bufsize < 0) [L32] len = __VERIFIER_nondet_int() [L33] int limit = bufsize - 4; [L34] i = 0 VAL [i=0, limit=0] Loop: [L34] COND TRUE i < len [L35] j = 0 [L35] COND FALSE !(i < len && j < limit) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 34]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L26] int len; [L27] int i; [L28] int j; [L29] int bufsize; [L30] bufsize = __VERIFIER_nondet_int() [L31] COND FALSE !(bufsize < 0) [L32] len = __VERIFIER_nondet_int() [L33] int limit = bufsize - 4; [L34] i = 0 VAL [i=0, limit=0] Loop: [L34] COND TRUE i < len [L35] j = 0 [L35] COND FALSE !(i < len && j < limit) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-08 14:39:28,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)