./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/n.c11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/n.c11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22d07de108fc4801b9b7475bdc68ff9a5f4a90db882102d1715237a6b65777f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 23:02:34,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 23:02:34,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 23:02:34,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 23:02:34,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 23:02:34,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 23:02:34,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 23:02:34,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 23:02:34,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 23:02:34,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 23:02:34,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 23:02:34,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 23:02:34,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 23:02:34,473 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 23:02:34,476 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 23:02:34,476 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 23:02:34,476 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 23:02:34,477 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 23:02:34,477 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 23:02:34,477 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 23:02:34,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 23:02:34,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 23:02:34,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 23:02:34,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 23:02:34,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 23:02:34,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 23:02:34,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 23:02:34,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 23:02:34,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 23:02:34,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 23:02:34,483 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 23:02:34,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 23:02:34,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 23:02:34,484 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 23:02:34,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 23:02:34,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 23:02:34,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 23:02:34,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 23:02:34,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 23:02:34,485 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 23:02:34,486 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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 -> c22d07de108fc4801b9b7475bdc68ff9a5f4a90db882102d1715237a6b65777f [2024-11-10 23:02:34,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 23:02:34,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 23:02:34,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 23:02:34,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 23:02:34,781 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 23:02:34,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/n.c11.c [2024-11-10 23:02:36,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 23:02:36,455 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 23:02:36,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/n.c11.c [2024-11-10 23:02:36,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1915551bc/4ca3944c68ed450cadaede6c7a86d352/FLAGe60b0b5f2 [2024-11-10 23:02:36,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1915551bc/4ca3944c68ed450cadaede6c7a86d352 [2024-11-10 23:02:36,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 23:02:36,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 23:02:36,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 23:02:36,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 23:02:36,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 23:02:36,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb18383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36, skipping insertion in model container [2024-11-10 23:02:36,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 23:02:36,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:02:36,712 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 23:02:36,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:02:36,739 INFO L204 MainTranslator]: Completed translation [2024-11-10 23:02:36,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36 WrapperNode [2024-11-10 23:02:36,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 23:02:36,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 23:02:36,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 23:02:36,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 23:02:36,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,770 INFO L138 Inliner]: procedures = 13, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2024-11-10 23:02:36,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 23:02:36,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 23:02:36,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 23:02:36,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 23:02:36,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,812 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-10 23:02:36,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 23:02:36,827 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 23:02:36,827 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 23:02:36,827 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 23:02:36,828 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (1/1) ... [2024-11-10 23:02:36,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:02:36,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:02:36,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:02:36,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 23:02:36,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 23:02:36,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 23:02:36,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 23:02:36,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 23:02:36,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 23:02:36,967 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 23:02:36,969 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 23:02:37,066 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-10 23:02:37,066 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 23:02:37,078 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 23:02:37,079 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 23:02:37,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:02:37 BoogieIcfgContainer [2024-11-10 23:02:37,079 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 23:02:37,082 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 23:02:37,082 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 23:02:37,086 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 23:02:37,087 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:02:37,087 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:02:36" (1/3) ... [2024-11-10 23:02:37,088 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@765d5927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:02:37, skipping insertion in model container [2024-11-10 23:02:37,088 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:02:37,088 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:36" (2/3) ... [2024-11-10 23:02:37,089 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@765d5927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:02:37, skipping insertion in model container [2024-11-10 23:02:37,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:02:37,089 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:02:37" (3/3) ... [2024-11-10 23:02:37,090 INFO L332 chiAutomizerObserver]: Analyzing ICFG n.c11.c [2024-11-10 23:02:37,133 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 23:02:37,133 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 23:02:37,133 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 23:02:37,133 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 23:02:37,134 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 23:02:37,134 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 23:02:37,134 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 23:02:37,134 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 23:02:37,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) [2024-11-10 23:02:37,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 23:02:37,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:02:37,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:02:37,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:02:37,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 23:02:37,160 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 23:02:37,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) [2024-11-10 23:02:37,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 23:02:37,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:02:37,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:02:37,164 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:02:37,164 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 23:02:37,172 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue 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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(46, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 10#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_~i~0#1; 12#L21true [2024-11-10 23:02:37,173 INFO L747 eck$LassoCheckResult]: Loop: 12#L21true assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1; 14#L21-1true assume !!(0 != main_#t~nondet4#1 % 256);havoc main_#t~nondet4#1; 13#L23true assume 4 == main_~len~0#1 % 4294967296;main_~len~0#1 := 0; 7#L26true assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12#L21true [2024-11-10 23:02:37,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:02:37,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2024-11-10 23:02:37,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:02:37,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113899246] [2024-11-10 23:02:37,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:02:37,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:02:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:37,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:02:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:37,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:02:37,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:02:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1353407, now seen corresponding path program 1 times [2024-11-10 23:02:37,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:02:37,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819630698] [2024-11-10 23:02:37,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:02:37,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:02:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:37,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:02:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:37,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:02:37,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:02:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1389405470, now seen corresponding path program 1 times [2024-11-10 23:02:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:02:37,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314027909] [2024-11-10 23:02:37,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:02:37,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:02:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:02:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:02:37,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:02:37,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314027909] [2024-11-10 23:02:37,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314027909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:02:37,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:02:37,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 23:02:37,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801523425] [2024-11-10 23:02:37,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:02:37,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:02:37,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 23:02:37,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 23:02:37,661 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-10 23:02:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:02:37,683 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-11-10 23:02:37,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2024-11-10 23:02:37,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 23:02:37,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 11 transitions. [2024-11-10 23:02:37,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-10 23:02:37,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-10 23:02:37,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2024-11-10 23:02:37,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:02:37,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-10 23:02:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2024-11-10 23:02:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-10 23:02:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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) [2024-11-10 23:02:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-10 23:02:37,713 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-10 23:02:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 23:02:37,718 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-10 23:02:37,718 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 23:02:37,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2024-11-10 23:02:37,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-10 23:02:37,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:02:37,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:02:37,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 23:02:37,721 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 23:02:37,721 INFO L745 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY 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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(46, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 44#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_~i~0#1; 45#L21 assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1; 51#L21-1 assume !!(0 != main_#t~nondet4#1 % 256);havoc main_#t~nondet4#1; 48#L23 assume !(4 == main_~len~0#1 % 4294967296); 49#L26 [2024-11-10 23:02:37,721 INFO L747 eck$LassoCheckResult]: Loop: 49#L26 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 46#L21 assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1; 47#L21-1 assume !!(0 != main_#t~nondet4#1 % 256);havoc main_#t~nondet4#1; 50#L23 assume 4 == main_~len~0#1 % 4294967296;main_~len~0#1 := 0; 49#L26 [2024-11-10 23:02:37,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:02:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash 44819532, now seen corresponding path program 1 times [2024-11-10 23:02:37,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:02:37,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285858326] [2024-11-10 23:02:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:02:37,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:02:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:37,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:02:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:37,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:02:37,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:02:37,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1205507, now seen corresponding path program 2 times [2024-11-10 23:02:37,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:02:37,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679228733] [2024-11-10 23:02:37,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:02:37,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:02:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:37,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:02:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:37,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:02:37,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:02:37,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1179462606, now seen corresponding path program 1 times [2024-11-10 23:02:37,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:02:37,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453157040] [2024-11-10 23:02:37,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:02:37,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:02:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:02:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:02:37,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:02:37,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453157040] [2024-11-10 23:02:37,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453157040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:02:37,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472622072] [2024-11-10 23:02:37,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:02:37,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:02:37,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:02:37,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:02:37,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 23:02:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:02:37,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 23:02:37,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:02:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:02:38,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:02:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:02:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472622072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:02:38,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:02:38,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 23:02:38,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979223923] [2024-11-10 23:02:38,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:02:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:02:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 23:02:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-10 23:02:38,129 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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) [2024-11-10 23:02:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:02:38,178 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-10 23:02:38,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2024-11-10 23:02:38,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-10 23:02:38,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2024-11-10 23:02:38,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-10 23:02:38,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-10 23:02:38,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2024-11-10 23:02:38,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:02:38,180 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-10 23:02:38,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2024-11-10 23:02:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-10 23:02:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 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) [2024-11-10 23:02:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-10 23:02:38,186 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-10 23:02:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 23:02:38,187 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-10 23:02:38,189 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 23:02:38,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2024-11-10 23:02:38,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-10 23:02:38,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:02:38,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:02:38,191 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 23:02:38,191 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 1] [2024-11-10 23:02:38,191 INFO L745 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY 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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(46, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 136#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_~i~0#1; 137#L21 assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1; 138#L21-1 assume !!(0 != main_#t~nondet4#1 % 256);havoc main_#t~nondet4#1; 139#L23 assume !(4 == main_~len~0#1 % 4294967296); 140#L26 [2024-11-10 23:02:38,191 INFO L747 eck$LassoCheckResult]: Loop: 140#L26 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 141#L21 assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1; 155#L21-1 assume !!(0 != main_#t~nondet4#1 % 256);havoc main_#t~nondet4#1; 154#L23 assume !(4 == main_~len~0#1 % 4294967296); 153#L26 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 152#L21 assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1; 151#L21-1 assume !!(0 != main_#t~nondet4#1 % 256);havoc main_#t~nondet4#1; 150#L23 assume !(4 == main_~len~0#1 % 4294967296); 149#L26 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 148#L21 assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1; 147#L21-1 assume !!(0 != main_#t~nondet4#1 % 256);havoc main_#t~nondet4#1; 146#L23 assume !(4 == main_~len~0#1 % 4294967296); 143#L26 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 145#L21 assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1; 144#L21-1 assume !!(0 != main_#t~nondet4#1 % 256);havoc main_#t~nondet4#1; 142#L23 assume 4 == main_~len~0#1 % 4294967296;main_~len~0#1 := 0; 140#L26 [2024-11-10 23:02:38,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:02:38,191 INFO L85 PathProgramCache]: Analyzing trace with hash 44819532, now seen corresponding path program 2 times [2024-11-10 23:02:38,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:02:38,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058333965] [2024-11-10 23:02:38,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:02:38,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:02:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:38,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:02:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:38,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:02:38,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:02:38,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1284818164, now seen corresponding path program 1 times [2024-11-10 23:02:38,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:02:38,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722007630] [2024-11-10 23:02:38,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:02:38,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:02:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:38,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:02:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:38,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:02:38,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:02:38,274 INFO L85 PathProgramCache]: Analyzing trace with hash -342677161, now seen corresponding path program 2 times [2024-11-10 23:02:38,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:02:38,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663450166] [2024-11-10 23:02:38,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:02:38,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:02:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:38,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:02:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:38,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:02:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:38,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:02:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:02:38,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:02:38 BoogieIcfgContainer [2024-11-10 23:02:38,953 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 23:02:38,954 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 23:02:38,954 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 23:02:38,955 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 23:02:38,955 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:02:37" (3/4) ... [2024-11-10 23:02:38,957 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-10 23:02:38,992 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 23:02:38,993 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 23:02:38,993 INFO L158 Benchmark]: Toolchain (without parser) took 2514.47ms. Allocated memory is still 157.3MB. Free memory was 89.9MB in the beginning and 93.1MB in the end (delta: -3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:02:38,993 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:02:38,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.23ms. Allocated memory is still 157.3MB. Free memory was 89.7MB in the beginning and 77.7MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 23:02:38,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.82ms. Allocated memory is still 157.3MB. Free memory was 77.5MB in the beginning and 76.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:02:38,994 INFO L158 Benchmark]: Boogie Preprocessor took 55.82ms. Allocated memory is still 157.3MB. Free memory was 76.1MB in the beginning and 130.3MB in the end (delta: -54.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-10 23:02:38,995 INFO L158 Benchmark]: IcfgBuilder took 252.25ms. Allocated memory is still 157.3MB. Free memory was 130.3MB in the beginning and 120.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 23:02:38,995 INFO L158 Benchmark]: BuchiAutomizer took 1871.55ms. Allocated memory is still 157.3MB. Free memory was 119.4MB in the beginning and 95.2MB in the end (delta: 24.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-11-10 23:02:38,996 INFO L158 Benchmark]: Witness Printer took 38.41ms. Allocated memory is still 157.3MB. Free memory was 95.2MB in the beginning and 93.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:02:38,999 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.15ms. Allocated memory is still 104.9MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.23ms. Allocated memory is still 157.3MB. Free memory was 89.7MB in the beginning and 77.7MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.82ms. Allocated memory is still 157.3MB. Free memory was 77.5MB in the beginning and 76.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.82ms. Allocated memory is still 157.3MB. Free memory was 76.1MB in the beginning and 130.3MB in the end (delta: -54.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * IcfgBuilder took 252.25ms. Allocated memory is still 157.3MB. Free memory was 130.3MB in the beginning and 120.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1871.55ms. Allocated memory is still 157.3MB. Free memory was 119.4MB in the beginning and 95.2MB in the end (delta: 24.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Witness Printer took 38.41ms. Allocated memory is still 157.3MB. Free memory was 95.2MB in the beginning and 93.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 3 iterations. TraceHistogramMax:4. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. 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: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 18 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 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: 21]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L15] int a[5]; [L16] unsigned int len=0; [L18] int i; VAL [len=0] [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) VAL [len=0] Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int a[5]; [L16] unsigned int len=0; [L18] int i; VAL [len=0] [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) VAL [len=0] Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-10 23:02:39,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 23:02:39,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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)