./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer --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 32bit --witnessprinter.graph.data.programhash f25230c4e3ada1aa4514132cfb87afb0e539c23b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:51:11,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:51:11,839 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:51:11,846 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:51:11,847 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:51:11,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:51:11,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:51:11,849 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:51:11,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:51:11,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:51:11,851 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:51:11,851 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:51:11,852 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:51:11,853 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:51:11,853 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:51:11,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:51:11,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:51:11,856 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:51:11,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:51:11,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:51:11,859 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:51:11,860 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:51:11,861 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:51:11,861 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:51:11,862 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:51:11,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:51:11,863 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:51:11,864 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:51:11,864 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:51:11,865 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:51:11,865 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:51:11,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:51:11,866 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:51:11,866 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:51:11,867 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:51:11,867 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:51:11,867 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 09:51:11,878 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:51:11,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:51:11,879 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:51:11,879 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:51:11,879 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:51:11,880 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:51:11,880 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:51:11,880 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:51:11,880 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:51:11,880 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:51:11,880 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:51:11,880 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:51:11,881 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:51:11,881 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:51:11,881 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:51:11,881 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:51:11,881 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:51:11,881 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:51:11,881 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:51:11,882 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:51:11,882 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:51:11,882 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:51:11,882 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:51:11,882 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:51:11,882 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:51:11,882 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:51:11,882 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:51:11,883 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:51:11,883 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:51:11,883 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:51:11,883 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:51:11,884 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:51:11,884 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f25230c4e3ada1aa4514132cfb87afb0e539c23b [2018-11-18 09:51:11,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:51:11,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:51:11,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:51:11,917 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:51:11,917 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:51:11,917 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-11-18 09:51:11,952 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer/data/cdc61f1b8/6fa75c8969f149c48a3c18ff835dc38e/FLAG27c5022c9 [2018-11-18 09:51:12,381 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:51:12,381 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-11-18 09:51:12,391 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer/data/cdc61f1b8/6fa75c8969f149c48a3c18ff835dc38e/FLAG27c5022c9 [2018-11-18 09:51:12,400 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer/data/cdc61f1b8/6fa75c8969f149c48a3c18ff835dc38e [2018-11-18 09:51:12,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:51:12,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:51:12,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:51:12,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:51:12,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:51:12,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:51:12" (1/1) ... [2018-11-18 09:51:12,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51981b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12, skipping insertion in model container [2018-11-18 09:51:12,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:51:12" (1/1) ... [2018-11-18 09:51:12,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:51:12,441 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:51:12,621 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:51:12,629 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:51:12,656 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:51:12,725 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:51:12,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12 WrapperNode [2018-11-18 09:51:12,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:51:12,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:51:12,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:51:12,727 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:51:12,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12" (1/1) ... [2018-11-18 09:51:12,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12" (1/1) ... [2018-11-18 09:51:12,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:51:12,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:51:12,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:51:12,750 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:51:12,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12" (1/1) ... [2018-11-18 09:51:12,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12" (1/1) ... [2018-11-18 09:51:12,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12" (1/1) ... [2018-11-18 09:51:12,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12" (1/1) ... [2018-11-18 09:51:12,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12" (1/1) ... [2018-11-18 09:51:12,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12" (1/1) ... [2018-11-18 09:51:12,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12" (1/1) ... [2018-11-18 09:51:12,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:51:12,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:51:12,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:51:12,768 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:51:12,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer/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-18 09:51:12,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:51:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:51:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:51:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:51:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:51:12,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:51:12,924 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:51:12,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:51:12 BoogieIcfgContainer [2018-11-18 09:51:12,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:51:12,925 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:51:12,925 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:51:12,927 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:51:12,928 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:51:12,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:51:12" (1/3) ... [2018-11-18 09:51:12,928 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@136a767b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:51:12, skipping insertion in model container [2018-11-18 09:51:12,928 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:51:12,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:12" (2/3) ... [2018-11-18 09:51:12,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@136a767b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:51:12, skipping insertion in model container [2018-11-18 09:51:12,929 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:51:12,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:51:12" (3/3) ... [2018-11-18 09:51:12,930 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-11-18 09:51:12,965 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:51:12,967 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:51:12,967 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:51:12,967 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:51:12,967 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:51:12,967 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:51:12,967 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:51:12,967 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:51:12,967 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:51:12,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-18 09:51:12,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-18 09:51:12,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:51:12,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:51:12,996 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 09:51:12,996 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 09:51:12,996 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:51:12,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-18 09:51:12,997 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-18 09:51:12,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:51:12,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:51:12,998 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 09:51:12,998 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 09:51:13,002 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 6#L544true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 13#L544-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 4#L546true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 9#L547-4true [2018-11-18 09:51:13,003 INFO L796 eck$LassoCheckResult]: Loop: 9#L547-4true assume true; 5#L547-1true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 21#L549true assume main_~val~0 < 0;main_~val~0 := 0; 3#L549-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 7#L547-3true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9#L547-4true [2018-11-18 09:51:13,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,007 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-18 09:51:13,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,078 INFO L82 PathProgramCache]: Analyzing trace with hash 45963670, now seen corresponding path program 1 times [2018-11-18 09:51:13,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1986381362, now seen corresponding path program 1 times [2018-11-18 09:51:13,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,276 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:51:13,277 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:51:13,277 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:51:13,278 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:51:13,278 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:51:13,278 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:51:13,278 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:51:13,278 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:51:13,278 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-18 09:51:13,278 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:51:13,279 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:51:13,294 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-18 09:51:13,298 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-18 09:51:13,300 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-18 09:51:13,301 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-18 09:51:13,303 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-18 09:51:13,307 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-18 09:51:13,310 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-18 09:51:13,314 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-18 09:51:13,317 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-18 09:51:13,395 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-18 09:51:13,396 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-18 09:51:13,397 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-18 09:51:13,562 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:51:13,566 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:51:13,567 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-18 09:51:13,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:13,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:13,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:13,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:13,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:13,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:13,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:13,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:13,573 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-18 09:51:13,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:13,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:13,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:13,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:13,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:13,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:13,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:13,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:13,576 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-18 09:51:13,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:13,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:13,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:13,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:13,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:13,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:13,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:13,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:13,579 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-18 09:51:13,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:13,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:13,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:13,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:13,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:13,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:13,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:13,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:13,581 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-18 09:51:13,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:13,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:13,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:13,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:13,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:51:13,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:13,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:13,588 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-18 09:51:13,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:13,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:13,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:13,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:13,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:13,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:13,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:13,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:13,594 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-18 09:51:13,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:13,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:13,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:13,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:13,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:13,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:13,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:13,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:13,597 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-18 09:51:13,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:13,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:13,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:13,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:13,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:51:13,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:13,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:13,603 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-18 09:51:13,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:13,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:13,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:13,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:13,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:51:13,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:13,658 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:51:13,672 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 09:51:13,672 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:51:13,674 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:51:13,675 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:51:13,676 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:51:13,676 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset Supporting invariants [] [2018-11-18 09:51:13,687 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 09:51:13,693 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:51:13,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:13,759 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-18 09:51:13,769 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:51:13,770 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 4 states. [2018-11-18 09:51:13,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 4 states. Result 51 states and 66 transitions. Complement of second has 7 states. [2018-11-18 09:51:13,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:51:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:51:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-18 09:51:13,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-18 09:51:13,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:13,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-18 09:51:13,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:13,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-18 09:51:13,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:13,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 66 transitions. [2018-11-18 09:51:13,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:51:13,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 19 states and 24 transitions. [2018-11-18 09:51:13,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 09:51:13,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 09:51:13,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-11-18 09:51:13,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:51:13,822 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-18 09:51:13,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-11-18 09:51:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-18 09:51:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 09:51:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-18 09:51:13,838 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-18 09:51:13,839 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-18 09:51:13,839 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:51:13,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-18 09:51:13,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:51:13,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:51:13,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:51:13,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,840 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 149#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 150#L544-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 143#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 144#L547-4 assume true; 145#L547-1 assume !(main_~i~0 < main_~length~0); 146#L547-5 main_~j~0 := 0; 158#L554-4 [2018-11-18 09:51:13,840 INFO L796 eck$LassoCheckResult]: Loop: 158#L554-4 assume true; 157#L554-1 assume !!(main_~j~0 < main_~length~0); 156#L555-4 assume true; 152#L555-1 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L555-2 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 155#L554-3 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 158#L554-4 [2018-11-18 09:51:13,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,841 INFO L82 PathProgramCache]: Analyzing trace with hash 176703704, now seen corresponding path program 1 times [2018-11-18 09:51:13,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:13,870 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-18 09:51:13,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:51:13,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:51:13,873 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:51:13,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2075738670, now seen corresponding path program 1 times [2018-11-18 09:51:13,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:51:13,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:51:13,910 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 09:51:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:13,939 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-11-18 09:51:13,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:51:13,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-11-18 09:51:13,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:51:13,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 28 transitions. [2018-11-18 09:51:13,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 09:51:13,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 09:51:13,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-18 09:51:13,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:51:13,941 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-18 09:51:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-18 09:51:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-11-18 09:51:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 09:51:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-18 09:51:13,943 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 09:51:13,943 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 09:51:13,943 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:51:13,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-18 09:51:13,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:51:13,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:51:13,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:51:13,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,944 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:51:13,944 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 199#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 200#L544-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 193#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 194#L547-4 assume true; 197#L547-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 198#L549 assume !(main_~val~0 < 0); 191#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 192#L547-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 201#L547-4 assume true; 195#L547-1 assume !(main_~i~0 < main_~length~0); 196#L547-5 main_~j~0 := 0; 208#L554-4 [2018-11-18 09:51:13,945 INFO L796 eck$LassoCheckResult]: Loop: 208#L554-4 assume true; 205#L554-1 assume !!(main_~j~0 < main_~length~0); 206#L555-4 assume true; 202#L555-1 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 203#L555-2 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 207#L554-3 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 208#L554-4 [2018-11-18 09:51:13,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,945 INFO L82 PathProgramCache]: Analyzing trace with hash -170474767, now seen corresponding path program 1 times [2018-11-18 09:51:13,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2075738670, now seen corresponding path program 2 times [2018-11-18 09:51:13,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:13,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:13,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1238241566, now seen corresponding path program 1 times [2018-11-18 09:51:13,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:13,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:13,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:51:13,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:14,123 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:51:14,123 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:51:14,123 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:51:14,123 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:51:14,123 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:51:14,124 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:51:14,124 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:51:14,124 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:51:14,124 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-18 09:51:14,124 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:51:14,124 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:51:14,126 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-18 09:51:14,128 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-18 09:51:14,129 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-18 09:51:14,130 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-18 09:51:14,218 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-18 09:51:14,219 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-18 09:51:14,220 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-18 09:51:14,221 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-18 09:51:14,222 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-18 09:51:14,224 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-18 09:51:14,225 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-18 09:51:14,337 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:51:14,338 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:51:14,338 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-18 09:51:14,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:14,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:14,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:14,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:14,340 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-18 09:51:14,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:14,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:14,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:14,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:14,342 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-18 09:51:14,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:14,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:14,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:14,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:14,344 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-18 09:51:14,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,344 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:51:14,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,346 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:51:14,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:14,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:14,352 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-18 09:51:14,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:51:14,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:14,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:14,359 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-18 09:51:14,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:51:14,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:14,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:14,362 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-18 09:51:14,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:51:14,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:14,387 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:51:14,403 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 09:51:14,403 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 09:51:14,404 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:51:14,405 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:51:14,405 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:51:14,405 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 Supporting invariants [] [2018-11-18 09:51:14,443 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 09:51:14,444 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:51:14,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:14,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:14,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:14,498 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-18 09:51:14,499 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:51:14,499 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 09:51:14,517 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 29 states and 35 transitions. Complement of second has 6 states. [2018-11-18 09:51:14,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:51:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:51:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-18 09:51:14,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-18 09:51:14,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:14,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-18 09:51:14,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:14,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 12 letters. [2018-11-18 09:51:14,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:14,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2018-11-18 09:51:14,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:51:14,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 34 transitions. [2018-11-18 09:51:14,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 09:51:14,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 09:51:14,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 34 transitions. [2018-11-18 09:51:14,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:51:14,525 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-18 09:51:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 34 transitions. [2018-11-18 09:51:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-11-18 09:51:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 09:51:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-18 09:51:14,527 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 09:51:14,527 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-18 09:51:14,527 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:51:14,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-11-18 09:51:14,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:51:14,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:51:14,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:51:14,528 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:14,528 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:51:14,529 INFO L794 eck$LassoCheckResult]: Stem: 353#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 346#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 339#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 340#L544-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 333#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 334#L547-4 assume true; 337#L547-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 338#L549 assume !(main_~val~0 < 0); 331#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 332#L547-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 341#L547-4 assume true; 335#L547-1 assume !(main_~i~0 < main_~length~0); 336#L547-5 main_~j~0 := 0; 352#L554-4 assume true; 350#L554-1 assume !!(main_~j~0 < main_~length~0); 347#L555-4 [2018-11-18 09:51:14,529 INFO L796 eck$LassoCheckResult]: Loop: 347#L555-4 assume true; 342#L555-1 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 343#L555-2 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 347#L555-4 [2018-11-18 09:51:14,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:14,530 INFO L82 PathProgramCache]: Analyzing trace with hash -617492554, now seen corresponding path program 1 times [2018-11-18 09:51:14,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:14,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:14,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:14,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:14,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:14,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:14,545 INFO L82 PathProgramCache]: Analyzing trace with hash 78517, now seen corresponding path program 1 times [2018-11-18 09:51:14,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:14,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:14,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:14,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:14,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:14,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:14,552 INFO L82 PathProgramCache]: Analyzing trace with hash -375698720, now seen corresponding path program 1 times [2018-11-18 09:51:14,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:14,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:14,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:14,702 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:51:14,702 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:51:14,702 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:51:14,702 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:51:14,702 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:51:14,703 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:51:14,703 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:51:14,703 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:51:14,703 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-18 09:51:14,703 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:51:14,703 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:51:14,705 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-18 09:51:14,706 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-18 09:51:14,707 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-18 09:51:14,708 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-18 09:51:14,709 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-18 09:51:14,712 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-18 09:51:14,713 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-18 09:51:14,815 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-18 09:51:14,817 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-18 09:51:14,819 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-18 09:51:14,820 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-18 09:51:14,986 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:51:14,986 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:51:14,986 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-18 09:51:14,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:14,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:14,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:14,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:14,988 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-18 09:51:14,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:14,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:14,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:14,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:14,989 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-18 09:51:14,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:51:14,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:14,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:14,992 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-18 09:51:14,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:14,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:14,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:14,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:14,994 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-18 09:51:14,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:14,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:14,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:14,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:14,996 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-18 09:51:14,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:14,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:14,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:14,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:14,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:14,997 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-18 09:51:14,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:14,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:14,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:14,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:15,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:51:15,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:15,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:15,007 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-18 09:51:15,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:15,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:15,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:15,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:15,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:51:15,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:15,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:15,013 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-18 09:51:15,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:15,013 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:51:15,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:15,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:15,014 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:51:15,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:15,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:15,019 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-18 09:51:15,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:15,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:15,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:15,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:15,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:51:15,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:15,027 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:51:15,031 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 09:51:15,032 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 09:51:15,032 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:51:15,033 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:51:15,033 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:51:15,033 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2 Supporting invariants [] [2018-11-18 09:51:15,059 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 09:51:15,062 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:51:15,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:15,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:15,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:15,109 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-18 09:51:15,109 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 09:51:15,109 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 09:51:15,130 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 39 states and 47 transitions. Complement of second has 8 states. [2018-11-18 09:51:15,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:51:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:51:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-18 09:51:15,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-18 09:51:15,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:15,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-18 09:51:15,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:15,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-18 09:51:15,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:15,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-18 09:51:15,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:51:15,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 31 states and 37 transitions. [2018-11-18 09:51:15,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 09:51:15,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 09:51:15,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2018-11-18 09:51:15,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:51:15,134 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-18 09:51:15,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2018-11-18 09:51:15,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-18 09:51:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 09:51:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-18 09:51:15,135 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-18 09:51:15,135 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-18 09:51:15,135 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:51:15,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2018-11-18 09:51:15,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:51:15,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:51:15,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:51:15,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:15,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:51:15,136 INFO L794 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 510#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 504#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 505#L544-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 501#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 502#L547-4 assume true; 499#L547-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 500#L549 assume !(main_~val~0 < 0); 495#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 496#L547-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 503#L547-4 assume true; 497#L547-1 assume !(main_~i~0 < main_~length~0); 498#L547-5 main_~j~0 := 0; 516#L554-4 assume true; 513#L554-1 assume !!(main_~j~0 < main_~length~0); 514#L555-4 assume true; 508#L555-1 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 509#L555-2 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 515#L554-3 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 520#L554-4 assume true; 511#L554-1 assume !!(main_~j~0 < main_~length~0); 512#L555-4 [2018-11-18 09:51:15,136 INFO L796 eck$LassoCheckResult]: Loop: 512#L555-4 assume true; 506#L555-1 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 507#L555-2 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 512#L555-4 [2018-11-18 09:51:15,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:15,136 INFO L82 PathProgramCache]: Analyzing trace with hash 244205219, now seen corresponding path program 2 times [2018-11-18 09:51:15,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:15,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:15,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:15,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:51:15,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:15,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:51:15,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86d935a8-c75e-4230-a1ec-1a776705a796/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:51:15,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:51:15,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:51:15,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:51:15,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:15,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:51:15,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-11-18 09:51:15,408 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:51:15,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:15,409 INFO L82 PathProgramCache]: Analyzing trace with hash 78517, now seen corresponding path program 2 times [2018-11-18 09:51:15,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:15,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:15,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:51:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:15,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 09:51:15,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:51:15,437 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 10 Second operand 14 states. [2018-11-18 09:51:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:51:15,628 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-11-18 09:51:15,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 09:51:15,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2018-11-18 09:51:15,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:51:15,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 39 states and 46 transitions. [2018-11-18 09:51:15,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 09:51:15,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 09:51:15,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2018-11-18 09:51:15,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:51:15,631 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-18 09:51:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2018-11-18 09:51:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-18 09:51:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 09:51:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-18 09:51:15,633 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-18 09:51:15,633 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-18 09:51:15,633 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 09:51:15,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2018-11-18 09:51:15,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:51:15,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:51:15,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:51:15,634 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:51:15,634 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:51:15,634 INFO L794 eck$LassoCheckResult]: Stem: 707#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 699#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 691#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 692#L544-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 688#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 689#L547-4 assume true; 697#L547-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 713#L549 assume !(main_~val~0 < 0); 712#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 711#L547-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 698#L547-4 assume true; 686#L547-1 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 687#L549 assume !(main_~val~0 < 0); 682#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 683#L547-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 690#L547-4 assume true; 684#L547-1 assume !(main_~i~0 < main_~length~0); 685#L547-5 main_~j~0 := 0; 706#L554-4 assume true; 710#L554-1 assume !!(main_~j~0 < main_~length~0); 705#L555-4 assume true; 716#L555-1 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 714#L555-2 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 708#L554-3 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 709#L554-4 assume true; 700#L554-1 assume !!(main_~j~0 < main_~length~0); 701#L555-4 [2018-11-18 09:51:15,634 INFO L796 eck$LassoCheckResult]: Loop: 701#L555-4 assume true; 693#L555-1 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 694#L555-2 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 701#L555-4 [2018-11-18 09:51:15,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash 851361066, now seen corresponding path program 3 times [2018-11-18 09:51:15,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:15,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:15,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:51:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:15,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash 78517, now seen corresponding path program 3 times [2018-11-18 09:51:15,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:15,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:15,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:15,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:51:15,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:15,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:15,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1115683052, now seen corresponding path program 1 times [2018-11-18 09:51:15,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:51:15,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:51:15,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:15,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:51:15,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:51:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:15,836 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2018-11-18 09:51:15,872 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:51:15,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:51:15,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:51:15,872 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:51:15,872 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:51:15,872 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:51:15,872 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:51:15,872 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:51:15,872 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-18 09:51:15,872 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:51:15,872 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:51:15,874 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-18 09:51:15,876 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-18 09:51:15,877 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-18 09:51:15,879 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-18 09:51:15,933 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-18 09:51:15,933 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-18 09:51:15,934 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-18 09:51:15,935 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-18 09:51:15,936 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-18 09:51:15,937 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-18 09:51:15,938 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-18 09:51:16,038 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:51:16,038 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:51:16,038 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-18 09:51:16,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:16,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:16,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:16,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:16,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:16,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:16,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:16,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:16,040 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-18 09:51:16,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:16,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:16,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:16,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:16,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:16,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:16,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:16,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:16,042 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-18 09:51:16,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:16,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:16,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:16,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:16,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:51:16,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:16,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:16,044 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-18 09:51:16,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:16,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:16,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:16,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:16,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:51:16,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:51:16,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:51:16,046 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-18 09:51:16,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:51:16,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:51:16,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:51:16,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:51:16,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:51:16,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:51:16,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:51:16,048 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:51:16,049 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:51:16,049 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:51:16,049 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:51:16,049 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 09:51:16,049 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:51:16,050 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_1 Supporting invariants [] [2018-11-18 09:51:16,062 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 09:51:16,063 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:51:16,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:16,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:16,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:16,090 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-18 09:51:16,090 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:51:16,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-18 09:51:16,100 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 41 states and 47 transitions. Complement of second has 7 states. [2018-11-18 09:51:16,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:51:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:51:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 09:51:16,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 26 letters. Loop has 3 letters. [2018-11-18 09:51:16,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:16,102 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:51:16,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:16,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:16,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:16,127 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-18 09:51:16,127 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:51:16,127 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-18 09:51:16,136 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 41 states and 47 transitions. Complement of second has 7 states. [2018-11-18 09:51:16,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:51:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:51:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 09:51:16,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 26 letters. Loop has 3 letters. [2018-11-18 09:51:16,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:16,137 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:51:16,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:51:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:16,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:16,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:51:16,168 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-18 09:51:16,168 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:51:16,169 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-18 09:51:16,179 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 45 states and 53 transitions. Complement of second has 6 states. [2018-11-18 09:51:16,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:51:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:51:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-18 09:51:16,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 26 letters. Loop has 3 letters. [2018-11-18 09:51:16,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:16,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 29 letters. Loop has 3 letters. [2018-11-18 09:51:16,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:16,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 26 letters. Loop has 6 letters. [2018-11-18 09:51:16,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:51:16,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 53 transitions. [2018-11-18 09:51:16,182 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:51:16,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-11-18 09:51:16,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:51:16,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:51:16,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:51:16,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:51:16,183 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:51:16,183 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:51:16,183 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:51:16,183 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 09:51:16,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:51:16,183 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:51:16,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:51:16,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:51:16 BoogieIcfgContainer [2018-11-18 09:51:16,187 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:51:16,188 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:51:16,188 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:51:16,188 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:51:16,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:51:12" (3/4) ... [2018-11-18 09:51:16,191 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:51:16,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:51:16,191 INFO L168 Benchmark]: Toolchain (without parser) took 3788.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 247.5 MB). Free memory was 955.4 MB in the beginning and 878.8 MB in the end (delta: 76.6 MB). Peak memory consumption was 324.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:16,192 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:51:16,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -209.7 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:16,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:16,193 INFO L168 Benchmark]: Boogie Preprocessor took 17.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:51:16,194 INFO L168 Benchmark]: RCFGBuilder took 156.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:16,194 INFO L168 Benchmark]: BuchiAutomizer took 3262.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 878.8 MB in the end (delta: 265.5 MB). Peak memory consumption was 335.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:16,195 INFO L168 Benchmark]: Witness Printer took 3.00 ms. Allocated memory is still 1.3 GB. Free memory is still 878.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:51:16,197 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -209.7 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 156.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3262.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 878.8 MB in the end (delta: 265.5 MB). Peak memory consumption was 335.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.00 ms. Allocated memory is still 1.3 GB. Free memory is still 878.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[arr] + -4 * i + -1 * arr and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + unknown-#length-unknown[arr] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr + 4 * j] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 2.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 137 SDtfs, 265 SDslu, 149 SDs, 0 SdLazy, 191 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital129 mio100 ax100 hnf98 lsp94 ukn78 mio100 lsp57 div100 bol100 ite100 ukn100 eq159 hnf91 smp90 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...