./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/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 64bit --witnessprinter.graph.data.programhash a398041f87cd84898ae142142fdf4872d746c3b1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 07:42:02,902 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 07:42:02,903 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 07:42:02,909 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 07:42:02,909 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 07:42:02,909 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 07:42:02,910 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 07:42:02,911 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 07:42:02,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 07:42:02,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 07:42:02,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 07:42:02,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 07:42:02,913 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 07:42:02,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 07:42:02,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 07:42:02,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 07:42:02,914 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 07:42:02,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 07:42:02,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 07:42:02,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 07:42:02,917 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 07:42:02,918 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 07:42:02,919 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 07:42:02,919 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 07:42:02,919 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 07:42:02,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 07:42:02,920 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 07:42:02,920 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 07:42:02,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 07:42:02,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 07:42:02,921 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 07:42:02,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 07:42:02,922 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 07:42:02,922 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 07:42:02,922 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 07:42:02,923 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 07:42:02,923 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 07:42:02,930 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 07:42:02,930 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 07:42:02,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 07:42:02,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 07:42:02,931 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 07:42:02,931 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 07:42:02,931 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 07:42:02,931 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 07:42:02,931 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 07:42:02,932 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 07:42:02,932 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 07:42:02,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 07:42:02,932 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 07:42:02,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 07:42:02,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 07:42:02,932 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 07:42:02,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 07:42:02,932 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 07:42:02,932 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 07:42:02,932 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 07:42:02,932 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 07:42:02,933 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 07:42:02,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 07:42:02,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 07:42:02,933 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 07:42:02,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 07:42:02,933 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 07:42:02,933 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 07:42:02,934 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 07:42:02,934 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_d25948fb-ec44-4adf-8328-6c475177ad15/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a398041f87cd84898ae142142fdf4872d746c3b1 [2018-12-09 07:42:02,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 07:42:02,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 07:42:02,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 07:42:02,959 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 07:42:02,959 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 07:42:02,960 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2018-12-09 07:42:02,993 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/bin-2019/uautomizer/data/6cc669d48/961c6a178e43426eb222170ab91789db/FLAG6086fe77f [2018-12-09 07:42:03,454 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 07:42:03,454 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2018-12-09 07:42:03,461 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/bin-2019/uautomizer/data/6cc669d48/961c6a178e43426eb222170ab91789db/FLAG6086fe77f [2018-12-09 07:42:03,469 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/bin-2019/uautomizer/data/6cc669d48/961c6a178e43426eb222170ab91789db [2018-12-09 07:42:03,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 07:42:03,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 07:42:03,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 07:42:03,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 07:42:03,474 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 07:42:03,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:42:03" (1/1) ... [2018-12-09 07:42:03,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eda5476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03, skipping insertion in model container [2018-12-09 07:42:03,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:42:03" (1/1) ... [2018-12-09 07:42:03,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 07:42:03,499 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 07:42:03,640 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:42:03,646 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 07:42:03,714 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:42:03,742 INFO L195 MainTranslator]: Completed translation [2018-12-09 07:42:03,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03 WrapperNode [2018-12-09 07:42:03,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 07:42:03,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 07:42:03,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 07:42:03,743 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 07:42:03,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03" (1/1) ... [2018-12-09 07:42:03,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03" (1/1) ... [2018-12-09 07:42:03,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 07:42:03,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 07:42:03,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 07:42:03,767 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 07:42:03,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03" (1/1) ... [2018-12-09 07:42:03,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03" (1/1) ... [2018-12-09 07:42:03,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03" (1/1) ... [2018-12-09 07:42:03,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03" (1/1) ... [2018-12-09 07:42:03,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03" (1/1) ... [2018-12-09 07:42:03,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03" (1/1) ... [2018-12-09 07:42:03,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03" (1/1) ... [2018-12-09 07:42:03,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 07:42:03,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 07:42:03,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 07:42:03,781 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 07:42:03,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/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-12-09 07:42:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 07:42:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 07:42:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 07:42:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 07:42:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 07:42:03,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 07:42:03,925 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 07:42:03,926 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 07:42:03,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:42:03 BoogieIcfgContainer [2018-12-09 07:42:03,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 07:42:03,926 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 07:42:03,926 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 07:42:03,928 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 07:42:03,929 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 07:42:03,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 07:42:03" (1/3) ... [2018-12-09 07:42:03,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@225e0c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 07:42:03, skipping insertion in model container [2018-12-09 07:42:03,930 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 07:42:03,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:42:03" (2/3) ... [2018-12-09 07:42:03,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@225e0c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 07:42:03, skipping insertion in model container [2018-12-09 07:42:03,930 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 07:42:03,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:42:03" (3/3) ... [2018-12-09 07:42:03,931 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.17-alloca_true-termination_true-no-overflow.c.i [2018-12-09 07:42:03,962 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 07:42:03,962 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 07:42:03,962 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 07:42:03,962 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 07:42:03,962 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 07:42:03,963 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 07:42:03,963 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 07:42:03,963 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 07:42:03,963 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 07:42:03,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-09 07:42:03,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 07:42:03,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:42:03,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:42:03,986 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 07:42:03,986 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 07:42:03,986 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 07:42:03,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-09 07:42:03,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 07:42:03,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:42:03,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:42:03,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 07:42:03,988 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 07:42:03,992 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 13#L557-3true [2018-12-09 07:42:03,992 INFO L796 eck$LassoCheckResult]: Loop: 13#L557-3true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 8#L557-1true assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 11#L558-3true assume !true; 14#L558-4true call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 13#L557-3true [2018-12-09 07:42:03,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:03,996 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 07:42:03,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:03,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:04,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:04,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:42:04,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:04,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:04,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-12-09 07:42:04,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:04,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:04,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:04,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:42:04,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:42:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:42:04,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:42:04,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 07:42:04,115 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 07:42:04,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 07:42:04,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 07:42:04,125 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-12-09 07:42:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:42:04,128 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-12-09 07:42:04,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 07:42:04,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-12-09 07:42:04,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 07:42:04,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-12-09 07:42:04,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-09 07:42:04,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-09 07:42:04,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-12-09 07:42:04,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 07:42:04,134 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-09 07:42:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-12-09 07:42:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-09 07:42:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 07:42:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-09 07:42:04,149 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-09 07:42:04,150 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-09 07:42:04,150 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 07:42:04,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-12-09 07:42:04,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 07:42:04,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:42:04,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:42:04,150 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 07:42:04,150 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 07:42:04,151 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L557-3 [2018-12-09 07:42:04,151 INFO L796 eck$LassoCheckResult]: Loop: 33#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 38#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 37#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 35#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 36#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 33#L557-3 [2018-12-09 07:42:04,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:04,151 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-09 07:42:04,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:04,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:04,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:04,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:42:04,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:04,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-12-09 07:42:04,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:04,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:04,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:04,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:42:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:04,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:04,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-12-09 07:42:04,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:04,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:04,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:04,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:42:04,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:04,596 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-09 07:42:04,718 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-09 07:42:04,726 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 07:42:04,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 07:42:04,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 07:42:04,727 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 07:42:04,727 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 07:42:04,727 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 07:42:04,727 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 07:42:04,727 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 07:42:04,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-12-09 07:42:04,727 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 07:42:04,728 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 07:42:04,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:04,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:04,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:04,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,059 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-12-09 07:42:05,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:05,506 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 07:42:05,509 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 07:42:05,510 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-12-09 07:42:05,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:05,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:05,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:05,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,514 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-12-09 07:42:05,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:05,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:05,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:05,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,516 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-12-09 07:42:05,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:05,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,520 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-12-09 07:42:05,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:05,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,526 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-12-09 07:42:05,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:05,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,532 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-12-09 07:42:05,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,532 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 07:42:05,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,535 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 07:42:05,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,544 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-12-09 07:42:05,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:05,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,554 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-12-09 07:42:05,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:05,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,582 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-12-09 07:42:05,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,582 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 07:42:05,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,584 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 07:42:05,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,590 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-12-09 07:42:05,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:05,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,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-12-09 07:42:05,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,595 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 07:42:05,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,596 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 07:42:05,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,601 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-12-09 07:42:05,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,602 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 07:42:05,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,603 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 07:42:05,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,607 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-12-09 07:42:05,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:05,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,611 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-12-09 07:42:05,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:05,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,615 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-12-09 07:42:05,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:05,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,621 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-12-09 07:42:05,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:05,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:05,627 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-12-09 07:42:05,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:05,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:05,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:05,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:05,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:05,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:05,644 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 07:42:05,659 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 07:42:05,659 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 07:42:05,661 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 07:42:05,662 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 07:42:05,663 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 07:42:05,663 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-12-09 07:42:05,767 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-12-09 07:42:05,771 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 07:42:05,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 07:42:05,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:42:05,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:42:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:42:05,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:42:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:42:05,873 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-09 07:42:05,874 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-12-09 07:42:05,961 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 17 states and 20 transitions. Complement of second has 11 states. [2018-12-09 07:42:05,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 07:42:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 07:42:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-09 07:42:05,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2018-12-09 07:42:05,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:42:05,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2018-12-09 07:42:05,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:42:05,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2018-12-09 07:42:05,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:42:05,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-12-09 07:42:05,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 07:42:05,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2018-12-09 07:42:05,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 07:42:05,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 07:42:05,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-12-09 07:42:05,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 07:42:05,966 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-09 07:42:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-12-09 07:42:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-09 07:42:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-09 07:42:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-09 07:42:05,968 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-09 07:42:05,968 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-09 07:42:05,968 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 07:42:05,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-12-09 07:42:05,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 07:42:05,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:42:05,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:42:05,969 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 07:42:05,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 07:42:05,970 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 260#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 261#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 274#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 275#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 263#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 264#L558-3 [2018-12-09 07:42:05,970 INFO L796 eck$LassoCheckResult]: Loop: 264#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 270#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 264#L558-3 [2018-12-09 07:42:05,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:05,970 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-12-09 07:42:05,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:05,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:05,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:05,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:42:05,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:05,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:05,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2018-12-09 07:42:05,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:05,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:05,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:05,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:42:05,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:05,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:05,998 INFO L82 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2018-12-09 07:42:05,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:05,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:05,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:05,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:42:05,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:06,486 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 121 [2018-12-09 07:42:06,690 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-09 07:42:06,692 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 07:42:06,692 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 07:42:06,692 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 07:42:06,692 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 07:42:06,692 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 07:42:06,692 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 07:42:06,692 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 07:42:06,692 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 07:42:06,692 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-09 07:42:06,692 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 07:42:06,692 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 07:42:06,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,932 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-12-09 07:42:06,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:06,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:07,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:07,341 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 07:42:07,341 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 07:42:07,341 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-12-09 07:42:07,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:07,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:07,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:07,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:07,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,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-12-09 07:42:07,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:07,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:07,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:07,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:07,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,345 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-12-09 07:42:07,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:07,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:07,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:07,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,348 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-12-09 07:42:07,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:07,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:07,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:07,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,350 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-12-09 07:42:07,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,350 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 07:42:07,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,351 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 07:42:07,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:07,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,354 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-12-09 07:42:07,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:07,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:07,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:07,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,357 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-12-09 07:42:07,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:07,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:07,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:07,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,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-12-09 07:42:07,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,362 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 07:42:07,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,363 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 07:42:07,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:07,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,365 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-12-09 07:42:07,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:07,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:07,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:07,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,367 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-12-09 07:42:07,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:07,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:07,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:07,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,370 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-12-09 07:42:07,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:07,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:07,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:07,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,372 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-12-09 07:42:07,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:07,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:07,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:07,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,374 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-12-09 07:42:07,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:07,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:07,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:07,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:07,376 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-12-09 07:42:07,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:07,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:07,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:07,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:07,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:07,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:07,386 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 07:42:07,393 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 07:42:07,393 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 07:42:07,393 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 07:42:07,394 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 07:42:07,394 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 07:42:07,394 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-12-09 07:42:07,476 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2018-12-09 07:42:07,477 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 07:42:07,477 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 07:42:07,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:42:07,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:42:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:42:07,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:42:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:42:07,516 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-12-09 07:42:07,516 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-09 07:42:07,531 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2018-12-09 07:42:07,531 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-12-09 07:42:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 07:42:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-09 07:42:07,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-09 07:42:07,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:42:07,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-09 07:42:07,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:42:07,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 07:42:07,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:42:07,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-12-09 07:42:07,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 07:42:07,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 26 transitions. [2018-12-09 07:42:07,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 07:42:07,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 07:42:07,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2018-12-09 07:42:07,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 07:42:07,534 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-12-09 07:42:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2018-12-09 07:42:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-09 07:42:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 07:42:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-12-09 07:42:07,535 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-09 07:42:07,535 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-09 07:42:07,535 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 07:42:07,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-12-09 07:42:07,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 07:42:07,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:42:07,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:42:07,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-09 07:42:07,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 07:42:07,536 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 474#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 475#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 489#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 493#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 492#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 491#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 477#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 478#L558-4 [2018-12-09 07:42:07,536 INFO L796 eck$LassoCheckResult]: Loop: 478#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 486#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 481#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 482#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 485#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 478#L558-4 [2018-12-09 07:42:07,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:07,536 INFO L82 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 1 times [2018-12-09 07:42:07,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:07,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:07,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:07,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:42:07,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:07,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:07,557 INFO L82 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 2 times [2018-12-09 07:42:07,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:07,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:07,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:07,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:42:07,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:07,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:07,565 INFO L82 PathProgramCache]: Analyzing trace with hash -474670094, now seen corresponding path program 1 times [2018-12-09 07:42:07,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:07,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:07,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:07,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:42:07,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:08,241 WARN L180 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2018-12-09 07:42:08,489 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-09 07:42:08,492 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 07:42:08,492 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 07:42:08,492 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 07:42:08,492 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 07:42:08,493 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 07:42:08,493 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 07:42:08,493 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 07:42:08,493 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 07:42:08,493 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-12-09 07:42:08,493 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 07:42:08,493 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 07:42:08,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:08,903 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2018-12-09 07:42:08,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:42:09,342 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 07:42:09,342 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 07:42:09,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-12-09 07:42:09,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:09,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:09,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:09,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,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-12-09 07:42:09,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:09,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:09,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,346 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-12-09 07:42:09,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:09,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:09,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:09,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,348 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-12-09 07:42:09,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:09,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:09,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:09,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,349 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-12-09 07:42:09,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:09,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:09,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:09,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,350 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-12-09 07:42:09,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:09,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:09,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,353 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-12-09 07:42:09,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:09,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:09,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:09,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,355 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-12-09 07:42:09,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:09,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:09,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:09,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,357 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-12-09 07:42:09,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:09,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:09,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,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-12-09 07:42:09,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:09,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:09,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:09,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,361 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-12-09 07:42:09,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:09,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:09,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:09,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,363 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-12-09 07:42:09,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:09,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:09,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,366 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-12-09 07:42:09,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:09,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:09,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:09,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,368 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-12-09 07:42:09,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:42:09,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:42:09,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:42:09,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,369 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-12-09 07:42:09,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,370 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 07:42:09,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,371 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 07:42:09,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:09,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,373 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-12-09 07:42:09,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:09,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:09,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,376 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-12-09 07:42:09,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:09,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:09,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,379 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-12-09 07:42:09,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,379 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 07:42:09,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,380 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 07:42:09,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:09,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:42:09,396 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-12-09 07:42:09,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:42:09,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:42:09,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:42:09,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:42:09,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:42:09,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:42:09,412 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 07:42:09,424 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 07:42:09,424 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 07:42:09,424 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 07:42:09,425 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 07:42:09,425 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 07:42:09,425 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-12-09 07:42:09,546 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-12-09 07:42:09,547 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 07:42:09,547 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 07:42:09,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:42:09,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:42:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:42:09,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:42:09,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:42:09,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-12-09 07:42:09,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:42:09,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2018-12-09 07:42:09,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-09 07:42:09,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:42:09,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-09 07:42:09,633 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 07:42:09,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 07:42:09,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 07:42:09,645 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:26 [2018-12-09 07:42:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:42:09,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-09 07:42:09,679 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-09 07:42:09,702 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 48 states and 58 transitions. Complement of second has 9 states. [2018-12-09 07:42:09,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 07:42:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 07:42:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-12-09 07:42:09,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 5 letters. [2018-12-09 07:42:09,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:42:09,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 5 letters. [2018-12-09 07:42:09,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:42:09,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 10 letters. [2018-12-09 07:42:09,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:42:09,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2018-12-09 07:42:09,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 07:42:09,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 46 transitions. [2018-12-09 07:42:09,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 07:42:09,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 07:42:09,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2018-12-09 07:42:09,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 07:42:09,707 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-12-09 07:42:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2018-12-09 07:42:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-12-09 07:42:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 07:42:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-12-09 07:42:09,709 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-09 07:42:09,709 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-09 07:42:09,709 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 07:42:09,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-12-09 07:42:09,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 07:42:09,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:42:09,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:42:09,710 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-12-09 07:42:09,711 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 07:42:09,711 INFO L794 eck$LassoCheckResult]: Stem: 776#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 774#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 775#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 783#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 784#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 779#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 780#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 790#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 781#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 782#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 777#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 778#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 791#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 792#L558-4 [2018-12-09 07:42:09,711 INFO L796 eck$LassoCheckResult]: Loop: 792#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 785#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 786#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 800#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 801#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 792#L558-4 [2018-12-09 07:42:09,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:09,711 INFO L82 PathProgramCache]: Analyzing trace with hash -652525668, now seen corresponding path program 2 times [2018-12-09 07:42:09,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:09,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:09,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:09,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:42:09,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:42:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:42:09,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:42:09,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d25948fb-ec44-4adf-8328-6c475177ad15/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-12-09 07:42:09,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 07:42:09,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 07:42:09,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:42:09,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:42:09,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:42:09,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 07:42:09,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:42:09,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:42:09,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 07:42:09,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 07:42:09,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:42:09,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:42:09,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-09 07:42:09,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:42:09,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 46 [2018-12-09 07:42:09,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:42:09,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-09 07:42:09,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 07:42:09,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:42:09,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:42:09,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2018-12-09 07:42:09,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-09 07:42:09,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 07:42:09,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 07:42:09,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-09 07:42:09,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 07:42:09,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:42:10,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:42:10,001 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-12-09 07:42:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:42:10,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 07:42:10,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2018-12-09 07:42:10,024 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 07:42:10,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:42:10,024 INFO L82 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 3 times [2018-12-09 07:42:10,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:42:10,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:42:10,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:10,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:42:10,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:42:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:42:10,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 07:42:10,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-12-09 07:42:10,071 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 14 states. [2018-12-09 07:42:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:42:10,213 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-09 07:42:10,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:42:10,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-12-09 07:42:10,214 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 07:42:10,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-12-09 07:42:10,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 07:42:10,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 07:42:10,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 07:42:10,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 07:42:10,214 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 07:42:10,214 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 07:42:10,214 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 07:42:10,214 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 07:42:10,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 07:42:10,214 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 07:42:10,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 07:42:10,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 07:42:10 BoogieIcfgContainer [2018-12-09 07:42:10,218 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 07:42:10,218 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 07:42:10,218 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 07:42:10,218 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 07:42:10,219 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:42:03" (3/4) ... [2018-12-09 07:42:10,221 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 07:42:10,221 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 07:42:10,221 INFO L168 Benchmark]: Toolchain (without parser) took 6750.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.0 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 11.5 GB. [2018-12-09 07:42:10,222 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 07:42:10,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 07:42:10,222 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-09 07:42:10,222 INFO L168 Benchmark]: Boogie Preprocessor took 13.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 07:42:10,222 INFO L168 Benchmark]: RCFGBuilder took 145.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-12-09 07:42:10,223 INFO L168 Benchmark]: BuchiAutomizer took 6291.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 185.0 MB. Max. memory is 11.5 GB. [2018-12-09 07:42:10,223 INFO L168 Benchmark]: Witness Printer took 2.56 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 07:42:10,225 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 145.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6291.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 185.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.56 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 5.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 25 SDslu, 10 SDs, 0 SdLazy, 127 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital876 mio100 ax102 hnf100 lsp96 ukn31 mio100 lsp33 div100 bol100 ite100 ukn100 eq194 hnf87 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms 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...