./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/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 fbe99a2ebd720adb01c27af71df604a9114f73ca ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:49:01,898 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:49:01,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:49:01,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:49:01,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:49:01,908 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:49:01,909 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:49:01,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:49:01,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:49:01,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:49:01,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:49:01,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:49:01,913 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:49:01,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:49:01,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:49:01,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:49:01,916 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:49:01,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:49:01,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:49:01,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:49:01,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:49:01,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:49:01,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:49:01,923 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:49:01,923 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:49:01,924 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:49:01,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:49:01,925 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:49:01,926 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:49:01,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:49:01,927 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:49:01,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:49:01,927 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:49:01,928 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:49:01,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:49:01,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:49:01,929 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:49:01,940 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:49:01,940 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:49:01,941 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:49:01,941 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:49:01,941 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:49:01,942 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:49:01,942 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:49:01,942 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:49:01,942 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:49:01,942 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:49:01,942 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:49:01,942 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:49:01,942 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:49:01,943 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:49:01,943 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:49:01,943 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:49:01,943 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:49:01,943 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:49:01,943 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:49:01,943 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:49:01,943 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:49:01,943 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:49:01,944 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:49:01,944 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:49:01,944 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:49:01,944 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:49:01,944 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:49:01,944 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:49:01,945 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:49:01,945 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_b9c11a26-5506-4a45-a34b-e3b70df79d97/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 -> fbe99a2ebd720adb01c27af71df604a9114f73ca [2018-11-28 12:49:01,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:49:01,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:49:01,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:49:01,983 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:49:01,983 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:49:01,983 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca_true-termination_true-no-overflow.c.i [2018-11-28 12:49:02,028 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/bin-2019/uautomizer/data/ad24e9600/2afd73f313d64e51aef29accaf9822cf/FLAG459a7a4aa [2018-11-28 12:49:02,393 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:49:02,393 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/sv-benchmarks/c/termination-memory-alloca/b.10-alloca_true-termination_true-no-overflow.c.i [2018-11-28 12:49:02,401 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/bin-2019/uautomizer/data/ad24e9600/2afd73f313d64e51aef29accaf9822cf/FLAG459a7a4aa [2018-11-28 12:49:02,412 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/bin-2019/uautomizer/data/ad24e9600/2afd73f313d64e51aef29accaf9822cf [2018-11-28 12:49:02,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:49:02,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:49:02,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:49:02,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:49:02,419 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:49:02,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:49:02" (1/1) ... [2018-11-28 12:49:02,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42171c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02, skipping insertion in model container [2018-11-28 12:49:02,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:49:02" (1/1) ... [2018-11-28 12:49:02,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:49:02,453 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:49:02,638 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:49:02,647 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:49:02,712 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:49:02,743 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:49:02,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02 WrapperNode [2018-11-28 12:49:02,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:49:02,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:49:02,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:49:02,744 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:49:02,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02" (1/1) ... [2018-11-28 12:49:02,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02" (1/1) ... [2018-11-28 12:49:02,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:49:02,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:49:02,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:49:02,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:49:02,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02" (1/1) ... [2018-11-28 12:49:02,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02" (1/1) ... [2018-11-28 12:49:02,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02" (1/1) ... [2018-11-28 12:49:02,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02" (1/1) ... [2018-11-28 12:49:02,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02" (1/1) ... [2018-11-28 12:49:02,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02" (1/1) ... [2018-11-28 12:49:02,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02" (1/1) ... [2018-11-28 12:49:02,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:49:02,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:49:02,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:49:02,788 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:49:02,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9c11a26-5506-4a45-a34b-e3b70df79d97/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:49:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:49:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:49:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:49:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:49:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:49:02,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:49:03,012 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:49:03,012 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 12:49:03,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:49:03 BoogieIcfgContainer [2018-11-28 12:49:03,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:49:03,013 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:49:03,013 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:49:03,015 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:49:03,015 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:49:03,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:49:02" (1/3) ... [2018-11-28 12:49:03,016 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69d16861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:49:03, skipping insertion in model container [2018-11-28 12:49:03,016 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:49:03,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:49:02" (2/3) ... [2018-11-28 12:49:03,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69d16861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:49:03, skipping insertion in model container [2018-11-28 12:49:03,017 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:49:03,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:49:03" (3/3) ... [2018-11-28 12:49:03,018 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.10-alloca_true-termination_true-no-overflow.c.i [2018-11-28 12:49:03,060 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:49:03,060 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:49:03,060 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:49:03,060 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:49:03,060 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:49:03,061 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:49:03,061 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:49:03,061 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:49:03,061 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:49:03,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 12:49:03,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 12:49:03,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:49:03,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:49:03,095 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:49:03,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:49:03,095 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:49:03,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 12:49:03,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 12:49:03,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:49:03,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:49:03,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:49:03,097 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:49:03,104 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem21, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 5#L559-2true [2018-11-28 12:49:03,104 INFO L796 eck$LassoCheckResult]: Loop: 5#L559-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 10#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 14#L555-3true test_fun_#t~short13 := test_fun_#t~short8; 16#L555-4true assume test_fun_#t~short13; 6#L555-9true test_fun_#t~short16 := test_fun_#t~short13; 8#L555-10true assume !test_fun_#t~short16; 11#L555-12true assume !!test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem15;havoc test_fun_#t~mem7;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 7#L556true assume test_fun_#t~mem17 > 0;havoc test_fun_#t~mem17;call test_fun_#t~mem18 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem18 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem18; 5#L559-2true [2018-11-28 12:49:03,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:03,108 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 12:49:03,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:03,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:03,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:03,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:03,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:03,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:03,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1790206705, now seen corresponding path program 1 times [2018-11-28 12:49:03,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:03,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:03,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:03,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:03,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:49:03,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:49:03,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:49:03,266 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:49:03,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:49:03,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:49:03,277 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2018-11-28 12:49:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:49:03,326 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-11-28 12:49:03,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:49:03,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-28 12:49:03,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 12:49:03,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2018-11-28 12:49:03,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 12:49:03,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 12:49:03,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-28 12:49:03,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:49:03,334 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 12:49:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-28 12:49:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 12:49:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 12:49:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-28 12:49:03,353 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-28 12:49:03,353 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-28 12:49:03,353 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:49:03,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-28 12:49:03,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 12:49:03,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:49:03,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:49:03,354 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:49:03,354 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:49:03,355 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 61#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem21, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 53#L559-2 [2018-11-28 12:49:03,355 INFO L796 eck$LassoCheckResult]: Loop: 53#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 54#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 60#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 63#L555-4 assume test_fun_#t~short13; 64#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 58#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 59#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem15;havoc test_fun_#t~mem7;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 56#L556 assume test_fun_#t~mem17 > 0;havoc test_fun_#t~mem17;call test_fun_#t~mem18 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem18 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem18; 53#L559-2 [2018-11-28 12:49:03,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 12:49:03,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:03,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:03,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:03,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:03,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:03,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:03,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1790208627, now seen corresponding path program 1 times [2018-11-28 12:49:03,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:03,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:03,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:03,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:49:03,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:03,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:03,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1099647153, now seen corresponding path program 1 times [2018-11-28 12:49:03,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:03,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:03,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:03,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:03,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:03,618 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-11-28 12:49:03,816 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-28 12:49:03,901 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:49:03,902 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:49:03,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:49:03,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:49:03,903 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:49:03,903 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:49:03,903 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:49:03,903 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:49:03,903 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.10-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-28 12:49:03,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:49:03,904 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:49:03,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:03,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:03,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:03,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:03,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:03,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:03,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:03,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:03,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:03,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,134 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-28 12:49:04,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:04,538 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:49:04,542 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:49:04,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-11-28 12:49:04,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:04,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:49:04,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:04,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:04,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:04,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:49:04,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:49:04,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:04,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:04,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:04,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:49:04,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:04,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:04,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:04,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:49:04,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:49:04,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:04,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-11-28 12:49:04,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:04,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:49:04,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:04,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:04,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:04,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:49:04,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:49:04,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:04,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:04,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:04,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:49:04,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:04,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:04,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:04,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:49:04,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:49:04,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:04,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:04,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:04,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:49:04,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:04,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:04,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:04,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:49:04,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:49:04,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:04,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:04,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:04,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:49:04,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:04,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:04,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:04,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:49:04,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:49:04,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:04,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:04,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:04,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:49:04,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:04,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:04,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:04,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:49:04,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:49:04,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:04,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:04,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:04,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:04,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:04,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:04,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:49:04,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:49:04,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:04,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:04,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:04,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:49:04,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:04,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:04,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:04,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:49:04,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:49:04,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:04,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:04,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:04,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:04,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:04,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:04,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:49:04,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:49:04,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:04,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:04,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:04,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:04,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:04,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:04,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:49:04,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:49:04,605 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:49:04,616 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:49:04,616 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:49:04,618 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:49:04,619 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:49:04,619 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:49:04,619 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 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-11-28 12:49:04,681 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-28 12:49:04,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:49:04,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:04,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:49:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:04,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:49:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:49:04,742 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:49:04,743 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 12:49:04,792 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 31 states and 45 transitions. Complement of second has 6 states. [2018-11-28 12:49:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:49:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:49:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-28 12:49:04,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 12:49:04,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:49:04,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-28 12:49:04,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:49:04,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-28 12:49:04,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:49:04,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2018-11-28 12:49:04,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 12:49:04,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2018-11-28 12:49:04,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 12:49:04,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 12:49:04,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2018-11-28 12:49:04,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:49:04,799 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-28 12:49:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2018-11-28 12:49:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-28 12:49:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 12:49:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-11-28 12:49:04,802 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-11-28 12:49:04,802 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-11-28 12:49:04,802 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:49:04,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 43 transitions. [2018-11-28 12:49:04,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 12:49:04,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:49:04,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:49:04,803 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:49:04,803 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:49:04,803 INFO L794 eck$LassoCheckResult]: Stem: 253#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 251#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem21, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 252#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 235#L555-1 [2018-11-28 12:49:04,803 INFO L796 eck$LassoCheckResult]: Loop: 235#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 249#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 254#L555-4 assume test_fun_#t~short13; 238#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 239#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 246#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem15;havoc test_fun_#t~mem7;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 241#L556 assume !(test_fun_#t~mem17 > 0);havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 242#L559 assume !(test_fun_#t~mem19 > 0);havoc test_fun_#t~mem19; 234#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 235#L555-1 [2018-11-28 12:49:04,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 12:49:04,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:04,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:04,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:04,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:04,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:04,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:04,823 INFO L82 PathProgramCache]: Analyzing trace with hash 572463690, now seen corresponding path program 1 times [2018-11-28 12:49:04,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:04,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:04,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:04,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:04,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:49:04,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:49:04,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:49:04,873 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:49:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:49:04,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:49:04,874 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-28 12:49:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:49:04,919 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-28 12:49:04,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:49:04,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2018-11-28 12:49:04,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 12:49:04,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 41 transitions. [2018-11-28 12:49:04,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 12:49:04,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 12:49:04,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2018-11-28 12:49:04,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:49:04,922 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-28 12:49:04,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2018-11-28 12:49:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 12:49:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 12:49:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2018-11-28 12:49:04,923 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-28 12:49:04,923 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-28 12:49:04,923 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:49:04,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2018-11-28 12:49:04,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 12:49:04,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:49:04,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:49:04,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:49:04,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:49:04,924 INFO L794 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 323#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem21, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 324#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 307#L555-1 [2018-11-28 12:49:04,925 INFO L796 eck$LassoCheckResult]: Loop: 307#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 321#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 326#L555-4 assume test_fun_#t~short13; 310#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 311#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 319#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~short12;havoc test_fun_#t~mem15;havoc test_fun_#t~mem7;havoc test_fun_#t~short13;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 314#L556 assume !(test_fun_#t~mem17 > 0);havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 315#L559 assume test_fun_#t~mem19 > 0;havoc test_fun_#t~mem19;call test_fun_#t~mem20 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem20 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem20; 306#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 307#L555-1 [2018-11-28 12:49:04,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-28 12:49:04,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:04,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:04,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:04,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:04,943 INFO L82 PathProgramCache]: Analyzing trace with hash 572463628, now seen corresponding path program 1 times [2018-11-28 12:49:04,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:04,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:04,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:04,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:49:04,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:04,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash -198955831, now seen corresponding path program 1 times [2018-11-28 12:49:04,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:49:04,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:49:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:04,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:49:04,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:49:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:49:05,109 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-11-28 12:49:05,380 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-11-28 12:49:05,578 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-28 12:49:05,580 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:49:05,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:49:05,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:49:05,580 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:49:05,580 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:49:05,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:49:05,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:49:05,581 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:49:05,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.10-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-28 12:49:05,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:49:05,581 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:49:05,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:05,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:05,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:05,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:05,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:05,927 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-11-28 12:49:05,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-11-28 12:49:05,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-11-28 12:49:05,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-11-28 12:49:06,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:49:06,449 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:49:06,450 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:49:06,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:06,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:06,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:49:06,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:06,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:06,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:06,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:49:06,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:49:06,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:06,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:06,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:06,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:49:06,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:06,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:06,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:06,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:49:06,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:49:06,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:06,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:06,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:06,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:49:06,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:06,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:06,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:06,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:49:06,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:49:06,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:06,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:06,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:06,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:49:06,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:06,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:06,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:06,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:49:06,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:49:06,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:06,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:06,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:06,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:06,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:06,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:06,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:49:06,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:49:06,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:06,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:06,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:06,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:06,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:06,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:06,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:49:06,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:49:06,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:06,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:06,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:06,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:06,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:06,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:06,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:49:06,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:49:06,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:06,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:06,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:06,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:49:06,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:49:06,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:06,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:49:06,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:49:06,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:49:06,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:49:06,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:49:06,479 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:49:06,479 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:49:06,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:49:06,489 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 12:49:06,489 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:49:06,564 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:49:06,596 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:49:06,597 INFO L444 ModelExtractionUtils]: 48 out of 56 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 12:49:06,597 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:49:06,598 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 12:49:06,598 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:49:06,598 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)_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-11-28 12:49:06,666 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-28 12:49:06,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:49:06,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:49:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:06,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:49:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:49:06,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:49:06,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:49:06,781 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 45 treesize of output 59 [2018-11-28 12:49:06,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:49:06,792 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 50 treesize of output 39 [2018-11-28 12:49:06,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:49:06,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:49:06,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:49:06,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:49:06,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-11-28 12:49:06,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:49:06,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:49:06,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 12:49:06,855 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:69 [2018-11-28 12:49:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:49:06,880 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-11-28 12:49:06,880 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 13 Second operand 7 states. [2018-11-28 12:49:06,966 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 60 states and 89 transitions. Complement of second has 10 states. [2018-11-28 12:49:06,966 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-11-28 12:49:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:49:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-28 12:49:06,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 3 letters. Loop has 9 letters. [2018-11-28 12:49:06,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:49:06,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 12 letters. Loop has 9 letters. [2018-11-28 12:49:06,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:49:06,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 3 letters. Loop has 18 letters. [2018-11-28 12:49:06,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:49:06,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 89 transitions. [2018-11-28 12:49:06,970 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:49:06,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 0 states and 0 transitions. [2018-11-28 12:49:06,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:49:06,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:49:06,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:49:06,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:49:06,970 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:49:06,970 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:49:06,970 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:49:06,970 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:49:06,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:49:06,971 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:49:06,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:49:06,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:49:06 BoogieIcfgContainer [2018-11-28 12:49:06,976 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:49:06,976 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:49:06,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:49:06,976 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:49:06,977 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:49:03" (3/4) ... [2018-11-28 12:49:06,979 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:49:06,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:49:06,980 INFO L168 Benchmark]: Toolchain (without parser) took 4565.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -96.0 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:49:06,981 INFO L168 Benchmark]: CDTParser took 0.15 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-11-28 12:49:06,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:49:06,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.11 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:49:06,982 INFO L168 Benchmark]: Boogie Preprocessor took 15.53 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-11-28 12:49:06,983 INFO L168 Benchmark]: RCFGBuilder took 224.36 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-11-28 12:49:06,983 INFO L168 Benchmark]: BuchiAutomizer took 3963.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.3 MB). Peak memory consumption was 100.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:49:06,984 INFO L168 Benchmark]: Witness Printer took 3.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:49:06,987 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.11 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.53 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 224.36 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3963.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.3 MB). Peak memory consumption was 100.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. 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 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 56 SDtfs, 27 SDslu, 103 SDs, 0 SdLazy, 101 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital423 mio100 ax105 hnf99 lsp72 ukn76 mio100 lsp30 div100 bol106 ite100 ukn100 eq163 hnf89 smp95 dnf221 smp73 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 119ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...