./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/add_last-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/add_last-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 83d173a249101326b0d087df992e67eaa15fd4df ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:47:11,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:47:11,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:47:11,895 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:47:11,896 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:47:11,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:47:11,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:47:11,905 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:47:11,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:47:11,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:47:11,915 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:47:11,916 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:47:11,917 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:47:11,918 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:47:11,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:47:11,924 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:47:11,925 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:47:11,927 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:47:11,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:47:11,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:47:11,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:47:11,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:47:11,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:47:11,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:47:11,938 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:47:11,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:47:11,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:47:11,941 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:47:11,942 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:47:11,943 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:47:11,943 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:47:11,944 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:47:11,945 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:47:11,945 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:47:11,946 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:47:11,946 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:47:11,947 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:47:11,965 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:47:11,966 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:47:11,967 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:47:11,967 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:47:11,967 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:47:11,968 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:47:11,968 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:47:11,968 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:47:11,968 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:47:11,968 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:47:11,969 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:47:11,970 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:47:11,970 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:47:11,970 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:47:11,970 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:47:11,971 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:47:11,971 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:47:11,971 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:47:11,972 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:47:11,972 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:47:11,972 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:47:11,972 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:47:11,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:47:11,973 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:47:11,973 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:47:11,973 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:47:11,973 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:47:11,973 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:47:11,976 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:47:11,976 INFO L133 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83d173a249101326b0d087df992e67eaa15fd4df [2019-01-01 21:47:12,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:47:12,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:47:12,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:47:12,049 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:47:12,050 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:47:12,050 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/add_last-alloca_true-termination.c.i [2019-01-01 21:47:12,118 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8805ada2/41a97d57ee3445ef9d52d8228e88bc79/FLAG65d8eca26 [2019-01-01 21:47:12,703 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:47:12,706 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/add_last-alloca_true-termination.c.i [2019-01-01 21:47:12,723 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8805ada2/41a97d57ee3445ef9d52d8228e88bc79/FLAG65d8eca26 [2019-01-01 21:47:13,006 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8805ada2/41a97d57ee3445ef9d52d8228e88bc79 [2019-01-01 21:47:13,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:47:13,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:47:13,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:13,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:47:13,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:47:13,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:13" (1/1) ... [2019-01-01 21:47:13,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4fbf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13, skipping insertion in model container [2019-01-01 21:47:13,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:13" (1/1) ... [2019-01-01 21:47:13,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:47:13,084 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:47:13,511 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:13,531 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:47:13,594 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:13,657 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:47:13,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13 WrapperNode [2019-01-01 21:47:13,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:13,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:13,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:47:13,660 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:47:13,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13" (1/1) ... [2019-01-01 21:47:13,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13" (1/1) ... [2019-01-01 21:47:13,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:13,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:47:13,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:47:13,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:47:13,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13" (1/1) ... [2019-01-01 21:47:13,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13" (1/1) ... [2019-01-01 21:47:13,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13" (1/1) ... [2019-01-01 21:47:13,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13" (1/1) ... [2019-01-01 21:47:13,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13" (1/1) ... [2019-01-01 21:47:13,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13" (1/1) ... [2019-01-01 21:47:13,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13" (1/1) ... [2019-01-01 21:47:13,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:47:13,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:47:13,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:47:13,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:47:13,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:47:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:47:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:47:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:47:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:47:13,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:47:14,302 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:47:14,303 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:47:14,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:14 BoogieIcfgContainer [2019-01-01 21:47:14,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:47:14,305 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:47:14,305 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:47:14,308 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:47:14,309 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:14,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:47:13" (1/3) ... [2019-01-01 21:47:14,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1db885b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:14, skipping insertion in model container [2019-01-01 21:47:14,314 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:14,315 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:13" (2/3) ... [2019-01-01 21:47:14,315 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1db885b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:14, skipping insertion in model container [2019-01-01 21:47:14,315 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:14,316 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:14" (3/3) ... [2019-01-01 21:47:14,319 INFO L375 chiAutomizerObserver]: Analyzing ICFG add_last-alloca_true-termination.c.i [2019-01-01 21:47:14,391 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:47:14,392 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:47:14,392 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:47:14,392 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:47:14,392 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:47:14,392 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:47:14,393 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:47:14,393 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:47:14,393 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:47:14,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:47:14,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:47:14,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:14,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:14,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:47:14,448 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:47:14,448 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:47:14,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:47:14,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:47:14,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:14,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:14,451 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:47:14,451 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:47:14,461 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem7, main_#t~post8.base, main_#t~post8.offset, main_#t~mem4, main_#t~mem5, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 11#L550true assume !(main_~length~0 < 1); 4#L550-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 8#L552true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset; 9#L554-3true [2019-01-01 21:47:14,462 INFO L796 eck$LassoCheckResult]: Loop: 9#L554-3true call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem5 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 5#L554-1true assume !!(main_#t~mem4 != main_#t~mem5);havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem6 + main_#t~mem7, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8.base, main_#t~post8.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post8.base, 4 + main_#t~post8.offset;havoc main_#t~post8.base, main_#t~post8.offset; 9#L554-3true [2019-01-01 21:47:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:14,470 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-01 21:47:14,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:14,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:14,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:14,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:14,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:14,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 1 times [2019-01-01 21:47:14,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:14,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:14,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:14,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:14,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:14,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815470, now seen corresponding path program 1 times [2019-01-01 21:47:14,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:14,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:14,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:14,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:14,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:14,913 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-01 21:47:15,050 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-01 21:47:15,346 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-01 21:47:15,486 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 21:47:15,508 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:15,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:15,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:15,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:15,510 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:15,510 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:15,511 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:15,511 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:15,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: add_last-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:47:15,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:15,511 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:15,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:15,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:15,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:15,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:15,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:15,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:15,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:15,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:15,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:15,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:15,908 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-01-01 21:47:16,506 WARN L181 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-01 21:47:16,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:16,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:16,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:16,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:16,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:16,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:17,134 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:17,141 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:17,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:17,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:17,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:17,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:17,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:17,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:17,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:17,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:17,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:17,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:17,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:17,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:17,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:17,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:17,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:17,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:17,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:17,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:17,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:17,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:17,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:17,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:17,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:17,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:17,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:17,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:17,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:17,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:17,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:17,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:17,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:17,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:17,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:17,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:17,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:17,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:17,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:17,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:17,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:17,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:17,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:17,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:17,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:17,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:17,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:17,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:17,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:17,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:17,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:17,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:17,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:17,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,223 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:47:17,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:17,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,230 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:47:17,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:17,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:17,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:17,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:17,298 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:47:17,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,300 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:47:17,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:17,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:17,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:17,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:17,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:17,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:17,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:17,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:17,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:17,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:17,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:17,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:17,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:17,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:17,457 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:17,501 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:47:17,501 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:47:17,505 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:17,507 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:47:17,508 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:17,508 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-01-01 21:47:17,618 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2019-01-01 21:47:17,633 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:47:17,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:17,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:17,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:47:17,863 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:47:17,865 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2019-01-01 21:47:17,972 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2019-01-01 21:47:17,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:47:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:47:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-01-01 21:47:17,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:47:17,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:17,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:47:17,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:17,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:47:17,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:17,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2019-01-01 21:47:17,987 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:17,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-01-01 21:47:17,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:47:17,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:47:17,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:47:17,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:47:17,994 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:17,994 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:17,994 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:17,994 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:47:17,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:47:17,995 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:17,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:47:18,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:47:18 BoogieIcfgContainer [2019-01-01 21:47:18,004 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:47:18,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:47:18,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:47:18,006 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:47:18,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:14" (3/4) ... [2019-01-01 21:47:18,011 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:47:18,011 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:47:18,012 INFO L168 Benchmark]: Toolchain (without parser) took 5000.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 951.3 MB in the beginning and 893.2 MB in the end (delta: 58.1 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:18,014 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:18,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.37 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:18,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:18,019 INFO L168 Benchmark]: Boogie Preprocessor took 33.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:18,019 INFO L168 Benchmark]: RCFGBuilder took 456.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:18,020 INFO L168 Benchmark]: BuchiAutomizer took 3699.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 893.2 MB in the end (delta: 192.9 MB). Peak memory consumption was 192.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:18,022 INFO L168 Benchmark]: Witness Printer took 7.33 ms. Allocated memory is still 1.1 GB. Free memory is still 893.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:18,028 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 644.37 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 153.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 456.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3699.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 893.2 MB in the end (delta: 192.9 MB). Peak memory consumption was 192.9 MB. Max. memory is 11.5 GB. * Witness Printer took 7.33 ms. Allocated memory is still 1.1 GB. Free memory is still 893.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[arr] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. 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 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 8 SDtfs, 10 SDslu, 6 SDs, 0 SdLazy, 10 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax112 hnf99 lsp85 ukn83 mio100 lsp54 div100 bol100 ite100 ukn100 eq173 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 71ms VariablesStem: 4 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...