./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/c.03-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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/c.03-alloca_true-termination_true-no-overflow.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 4eacdd25ec766896c06b3ec61ff2eab4c80478ff ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:20:02,776 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:20:02,778 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:20:02,791 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:20:02,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:20:02,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:20:02,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:20:02,797 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:20:02,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:20:02,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:20:02,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:20:02,801 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:20:02,802 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:20:02,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:20:02,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:20:02,806 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:20:02,807 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:20:02,809 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:20:02,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:20:02,814 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:20:02,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:20:02,817 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:20:02,820 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:20:02,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:20:02,821 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:20:02,823 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:20:02,824 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:20:02,825 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:20:02,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:20:02,827 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:20:02,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:20:02,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:20:02,829 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:20:02,829 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:20:02,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:20:02,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:20:02,833 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:20:02,851 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:20:02,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:20:02,852 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:20:02,853 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:20:02,853 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:20:02,853 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:20:02,854 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:20:02,854 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:20:02,854 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:20:02,854 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:20:02,854 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:20:02,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:20:02,855 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:20:02,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:20:02,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:20:02,855 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:20:02,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:20:02,857 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:20:02,857 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:20:02,858 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:20:02,858 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:20:02,858 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:20:02,858 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:20:02,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:20:02,859 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:20:02,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:20:02,859 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:20:02,859 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:20:02,861 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:20:02,862 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 -> 4eacdd25ec766896c06b3ec61ff2eab4c80478ff [2018-11-28 23:20:02,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:20:02,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:20:02,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:20:02,930 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:20:02,931 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:20:02,932 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/c.03-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:20:02,999 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dda17d0b5/fe6d75d63c0747fcb41aa91413820542/FLAG4dc125f12 [2018-11-28 23:20:03,576 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:20:03,577 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/c.03-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:20:03,591 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dda17d0b5/fe6d75d63c0747fcb41aa91413820542/FLAG4dc125f12 [2018-11-28 23:20:03,858 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dda17d0b5/fe6d75d63c0747fcb41aa91413820542 [2018-11-28 23:20:03,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:20:03,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:20:03,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:20:03,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:20:03,871 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:20:03,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:20:03" (1/1) ... [2018-11-28 23:20:03,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f5feda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:03, skipping insertion in model container [2018-11-28 23:20:03,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:20:03" (1/1) ... [2018-11-28 23:20:03,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:20:03,939 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:20:04,354 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:20:04,372 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:20:04,440 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:20:04,580 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:20:04,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:04 WrapperNode [2018-11-28 23:20:04,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:20:04,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:20:04,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:20:04,582 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:20:04,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:04" (1/1) ... [2018-11-28 23:20:04,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:04" (1/1) ... [2018-11-28 23:20:04,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:20:04,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:20:04,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:20:04,633 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:20:04,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:04" (1/1) ... [2018-11-28 23:20:04,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:04" (1/1) ... [2018-11-28 23:20:04,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:04" (1/1) ... [2018-11-28 23:20:04,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:04" (1/1) ... [2018-11-28 23:20:04,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:04" (1/1) ... [2018-11-28 23:20:04,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:04" (1/1) ... [2018-11-28 23:20:04,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:04" (1/1) ... [2018-11-28 23:20:04,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:20:04,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:20:04,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:20:04,663 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:20:04,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:04" (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 [2018-11-28 23:20:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:20:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:20:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:20:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:20:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:20:04,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:20:05,152 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:20:05,152 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:20:05,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:05 BoogieIcfgContainer [2018-11-28 23:20:05,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:20:05,155 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:20:05,155 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:20:05,159 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:20:05,160 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:20:05,160 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:20:03" (1/3) ... [2018-11-28 23:20:05,163 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dfe29d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:20:05, skipping insertion in model container [2018-11-28 23:20:05,164 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:20:05,164 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:04" (2/3) ... [2018-11-28 23:20:05,164 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dfe29d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:20:05, skipping insertion in model container [2018-11-28 23:20:05,164 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:20:05,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:05" (3/3) ... [2018-11-28 23:20:05,166 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.03-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:20:05,227 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:20:05,227 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:20:05,228 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:20:05,228 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:20:05,228 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:20:05,228 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:20:05,228 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:20:05,228 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:20:05,229 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:20:05,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 23:20:05,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:20:05,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:05,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:05,283 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:20:05,283 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:05,283 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:20:05,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 23:20:05,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:20:05,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:05,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:05,287 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:20:05,288 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:05,297 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 9#L558-2true [2018-11-28 23:20:05,298 INFO L796 eck$LassoCheckResult]: Loop: 9#L558-2true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 10#L557-1true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 13#L557-3true assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 5#L558true assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem10;havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 9#L558-2true [2018-11-28 23:20:05,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:05,305 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:20:05,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:05,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:05,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:05,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:05,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:05,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2018-11-28 23:20:05,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:05,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:05,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:05,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:05,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:05,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:05,580 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2018-11-28 23:20:05,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:05,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:05,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:05,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:05,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:06,155 WARN L180 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-28 23:20:06,486 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 23:20:07,636 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-28 23:20:07,898 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-28 23:20:07,915 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:07,917 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:07,917 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:07,917 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:07,919 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:07,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:07,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:07,922 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:07,922 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.03-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-28 23:20:07,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:07,923 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:07,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:07,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,993 WARN L180 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-28 23:20:09,243 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2018-11-28 23:20:09,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:09,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:09,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:09,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:09,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:09,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:09,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:09,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:09,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:09,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:09,664 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-11-28 23:20:10,461 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:10,467 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:10,470 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 [2018-11-28 23:20:10,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,480 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 [2018-11-28 23:20:10,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:10,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,495 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 [2018-11-28 23:20:10,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,504 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 [2018-11-28 23:20:10,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,509 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 [2018-11-28 23:20:10,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,518 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 [2018-11-28 23:20:10,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:10,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,536 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 [2018-11-28 23:20:10,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,540 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 [2018-11-28 23:20:10,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,542 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 [2018-11-28 23:20:10,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:10,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,550 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 [2018-11-28 23:20:10,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,551 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:10,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,557 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:10,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,575 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 [2018-11-28 23:20:10,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:10,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,592 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 [2018-11-28 23:20:10,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:10,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,662 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:10,685 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:20:10,685 INFO L444 ModelExtractionUtils]: 37 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:20:10,691 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:10,694 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:10,696 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:10,698 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 4294967291 Supporting invariants [] [2018-11-28 23:20:10,988 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-28 23:20:10,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:11,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:11,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:11,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:11,203 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:20:11,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2018-11-28 23:20:11,586 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 28 states and 36 transitions. Complement of second has 9 states. [2018-11-28 23:20:11,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:20:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-28 23:20:11,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:20:11,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:11,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:20:11,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:11,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 23:20:11,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:11,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 36 transitions. [2018-11-28 23:20:11,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:20:11,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 13 states and 19 transitions. [2018-11-28 23:20:11,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:20:11,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:20:11,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2018-11-28 23:20:11,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:11,604 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-28 23:20:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2018-11-28 23:20:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-28 23:20:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:20:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-11-28 23:20:11,632 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-28 23:20:11,632 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-28 23:20:11,632 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:20:11,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2018-11-28 23:20:11,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:20:11,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:11,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:11,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:20:11,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:11,633 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 253#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 254#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 261#L557-1 [2018-11-28 23:20:11,634 INFO L796 eck$LassoCheckResult]: Loop: 261#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 263#L557-3 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 255#L558 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem10;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem13; 256#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 261#L557-1 [2018-11-28 23:20:11,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:11,634 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:20:11,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:11,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:11,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:11,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:11,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:11,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:11,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1239449, now seen corresponding path program 1 times [2018-11-28 23:20:11,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:11,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:11,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:11,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:11,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:11,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:11,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849212, now seen corresponding path program 1 times [2018-11-28 23:20:11,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:11,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:11,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:11,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:11,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:12,055 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2018-11-28 23:20:12,198 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-28 23:20:12,925 WARN L180 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2018-11-28 23:20:13,622 WARN L180 SmtUtils]: Spent 694.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-11-28 23:20:13,625 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:13,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:13,625 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:13,625 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:13,625 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:13,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:13,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:13,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:13,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.03-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-28 23:20:13,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:13,627 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:13,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:13,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:13,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:13,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:13,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:13,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:15,335 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2018-11-28 23:20:15,614 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2018-11-28 23:20:15,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:15,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:15,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:15,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:15,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:15,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:15,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:15,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20: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 [2018-11-28 23:20:15,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:15,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:15,920 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-11-28 23:20:16,155 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-28 23:20:16,701 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-11-28 23:20:16,909 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-11-28 23:20:17,123 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:17,123 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:17,124 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 [2018-11-28 23:20:17,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:17,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:17,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:17,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:17,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:17,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:17,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:17,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:17,130 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 [2018-11-28 23:20:17,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:17,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:17,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:17,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:17,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:17,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:17,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:17,137 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 [2018-11-28 23:20:17,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:17,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:17,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:17,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:17,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:17,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:17,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:17,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20: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 [2018-11-28 23:20:17,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:17,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:17,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:17,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:17,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:17,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:17,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:17,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:17,148 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 [2018-11-28 23:20:17,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:17,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:17,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:17,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:17,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:17,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:17,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:17,155 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 [2018-11-28 23:20:17,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:17,156 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:17,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:17,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:17,160 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:17,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:17,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:17,167 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 [2018-11-28 23:20:17,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:17,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:17,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:17,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:17,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:17,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:17,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:17,175 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 [2018-11-28 23:20:17,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:17,176 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:17,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:17,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:17,180 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:17,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:17,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:17,187 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 [2018-11-28 23:20:17,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:17,188 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:17,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:17,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:17,189 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:17,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:17,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:17,198 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 [2018-11-28 23:20:17,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:17,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:17,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:17,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:17,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:17,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:17,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:17,210 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 [2018-11-28 23:20:17,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:17,211 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:17,212 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:20:17,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:17,229 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 23:20:17,229 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:20:17,421 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:17,502 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:20:17,502 INFO L444 ModelExtractionUtils]: 71 out of 81 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 23:20:17,503 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:17,507 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 23:20:17,508 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:17,509 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 4294967293 Supporting invariants [] [2018-11-28 23:20:18,118 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-28 23:20:18,120 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:18,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:18,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:18,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:18,286 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-28 23:20:18,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:18,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-28 23:20:18,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:18,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-28 23:20:18,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:18,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:18,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:18,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-11-28 23:20:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:18,370 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:20:18,370 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-28 23:20:18,423 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 24 states and 41 transitions. Complement of second has 8 states. [2018-11-28 23:20:18,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:20:18,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-28 23:20:18,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 23:20:18,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:18,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 23:20:18,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:18,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-28 23:20:18,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:18,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 41 transitions. [2018-11-28 23:20:18,432 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:18,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-28 23:20:18,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:20:18,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:20:18,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:20:18,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:18,433 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:18,433 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:18,434 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:18,434 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:20:18,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:20:18,434 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:18,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:20:18,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:20:18 BoogieIcfgContainer [2018-11-28 23:20:18,441 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:20:18,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:20:18,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:20:18,442 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:20:18,443 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:05" (3/4) ... [2018-11-28 23:20:18,446 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:20:18,446 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:20:18,447 INFO L168 Benchmark]: Toolchain (without parser) took 14583.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 253.2 MB). Free memory was 954.0 MB in the beginning and 1.2 GB in the end (delta: -209.8 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:18,448 INFO L168 Benchmark]: CDTParser took 0.15 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. [2018-11-28 23:20:18,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -117.1 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:18,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.00 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:18,451 INFO L168 Benchmark]: Boogie Preprocessor took 30.09 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. [2018-11-28 23:20:18,451 INFO L168 Benchmark]: RCFGBuilder took 490.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:18,452 INFO L168 Benchmark]: BuchiAutomizer took 13286.68 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -119.2 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:18,453 INFO L168 Benchmark]: Witness Printer took 4.45 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:18,458 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.15 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 714.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.6 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -117.1 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.00 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.09 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 490.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13286.68 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -119.2 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.45 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x_ref][x_ref] + 4294967291 and consists of 6 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 12.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 10 SDtfs, 13 SDslu, 13 SDs, 0 SdLazy, 34 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital612 mio100 ax103 hnf99 lsp71 ukn74 mio100 lsp30 div100 bol105 ite100 ukn100 eq178 hnf88 smp95 dnf227 smp75 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 297ms VariablesStem: 15 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...