./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/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 e6c4332f1874752b59e29803328ba77ee4005585 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:14:49,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:14:49,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:14:49,575 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:14:49,575 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:14:49,576 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:14:49,577 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:14:49,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:14:49,579 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:14:49,580 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:14:49,580 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:14:49,581 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:14:49,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:14:49,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:14:49,583 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:14:49,584 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:14:49,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:14:49,586 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:14:49,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:14:49,589 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:14:49,590 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:14:49,591 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:14:49,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:14:49,593 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:14:49,593 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:14:49,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:14:49,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:14:49,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:14:49,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:14:49,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:14:49,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:14:49,598 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:14:49,599 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:14:49,599 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:14:49,600 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:14:49,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:14:49,601 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:14:49,612 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:14:49,613 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:14:49,614 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:14:49,614 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:14:49,614 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:14:49,615 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:14:49,615 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:14:49,615 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:14:49,615 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:14:49,615 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:14:49,615 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:14:49,615 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:14:49,616 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:14:49,616 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:14:49,616 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:14:49,616 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:14:49,616 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:14:49,616 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:14:49,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:14:49,617 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:14:49,617 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:14:49,617 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:14:49,617 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:14:49,619 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:14:49,619 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:14:49,619 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:14:49,620 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:14:49,620 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:14:49,620 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:14:49,621 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_7e828691-dea9-4a36-bb66-be6e6f37da26/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 -> e6c4332f1874752b59e29803328ba77ee4005585 [2018-11-18 12:14:49,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:14:49,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:14:49,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:14:49,657 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:14:49,657 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:14:49,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:14:49,695 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/bin-2019/uautomizer/data/b33c25d9b/1ef59c363b394441b54b439f75162e4b/FLAG78aeff15a [2018-11-18 12:14:50,137 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:14:50,137 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/sv-benchmarks/c/termination-memory-alloca/a.06-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:14:50,148 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/bin-2019/uautomizer/data/b33c25d9b/1ef59c363b394441b54b439f75162e4b/FLAG78aeff15a [2018-11-18 12:14:50,157 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/bin-2019/uautomizer/data/b33c25d9b/1ef59c363b394441b54b439f75162e4b [2018-11-18 12:14:50,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:14:50,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:14:50,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:14:50,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:14:50,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:14:50,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:14:50" (1/1) ... [2018-11-18 12:14:50,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3270d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50, skipping insertion in model container [2018-11-18 12:14:50,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:14:50" (1/1) ... [2018-11-18 12:14:50,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:14:50,206 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:14:50,403 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:14:50,413 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:14:50,445 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:14:50,515 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:14:50,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50 WrapperNode [2018-11-18 12:14:50,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:14:50,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:14:50,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:14:50,516 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:14:50,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50" (1/1) ... [2018-11-18 12:14:50,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50" (1/1) ... [2018-11-18 12:14:50,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:14:50,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:14:50,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:14:50,548 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:14:50,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50" (1/1) ... [2018-11-18 12:14:50,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50" (1/1) ... [2018-11-18 12:14:50,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50" (1/1) ... [2018-11-18 12:14:50,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50" (1/1) ... [2018-11-18 12:14:50,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50" (1/1) ... [2018-11-18 12:14:50,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50" (1/1) ... [2018-11-18 12:14:50,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50" (1/1) ... [2018-11-18 12:14:50,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:14:50,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:14:50,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:14:50,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:14:50,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e828691-dea9-4a36-bb66-be6e6f37da26/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:14:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:14:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:14:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:14:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:14:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:14:50,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:14:50,804 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:14:50,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:14:50 BoogieIcfgContainer [2018-11-18 12:14:50,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:14:50,805 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:14:50,805 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:14:50,807 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:14:50,808 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:14:50,808 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:14:50" (1/3) ... [2018-11-18 12:14:50,809 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44ade3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:14:50, skipping insertion in model container [2018-11-18 12:14:50,809 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:14:50,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:14:50" (2/3) ... [2018-11-18 12:14:50,809 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44ade3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:14:50, skipping insertion in model container [2018-11-18 12:14:50,809 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:14:50,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:14:50" (3/3) ... [2018-11-18 12:14:50,811 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.06-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:14:50,845 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:14:50,846 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:14:50,846 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:14:50,846 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:14:50,846 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:14:50,846 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:14:50,846 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:14:50,847 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:14:50,847 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:14:50,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-18 12:14:50,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 12:14:50,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:14:50,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:14:50,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:14:50,878 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:14:50,878 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:14:50,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-18 12:14:50,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 12:14:50,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:14:50,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:14:50,879 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:14:50,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:14:50,884 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 5#L557-21true [2018-11-18 12:14:50,885 INFO L796 eck$LassoCheckResult]: Loop: 5#L557-21true assume true; 8#L557-1true call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 9#L557-2true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 14#L557-4true test_fun_#t~short14 := test_fun_#t~short9; 16#L557-5true assume test_fun_#t~short14; 4#L557-10true test_fun_#t~short18 := test_fun_#t~short14; 6#L557-11true assume test_fun_#t~short18;call test_fun_#t~mem17 := 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);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 10#L557-13true test_fun_#t~short20 := test_fun_#t~short18; 11#L557-14true assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 17#L557-16true test_fun_#t~short22 := test_fun_#t~short20; 19#L557-17true assume !test_fun_#t~short22; 23#L557-19true assume !!test_fun_#t~short22;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem10;havoc test_fun_#t~short18;havoc test_fun_#t~mem7;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~mem12;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~short9;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 5#L557-21true [2018-11-18 12:14:50,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:50,891 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:14:50,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:14:50,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:14:50,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:50,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:50,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:51,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:51,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2005892128, now seen corresponding path program 1 times [2018-11-18 12:14:51,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:14:51,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:14:51,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:51,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:51,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:51,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:14:51,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:14:51,074 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:14:51,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:14:51,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:14:51,085 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-11-18 12:14:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:14:51,113 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2018-11-18 12:14:51,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:14:51,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2018-11-18 12:14:51,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 12:14:51,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 21 transitions. [2018-11-18 12:14:51,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 12:14:51,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 12:14:51,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-11-18 12:14:51,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:14:51,121 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-18 12:14:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-11-18 12:14:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 12:14:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 12:14:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-11-18 12:14:51,145 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-18 12:14:51,145 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-18 12:14:51,145 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:14:51,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2018-11-18 12:14:51,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 12:14:51,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:14:51,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:14:51,146 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:14:51,146 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:14:51,147 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 55#L557-21 [2018-11-18 12:14:51,147 INFO L796 eck$LassoCheckResult]: Loop: 55#L557-21 assume true; 56#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 58#L557-2 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 59#L557-4 test_fun_#t~short14 := test_fun_#t~short9; 63#L557-5 assume test_fun_#t~short14; 53#L557-10 test_fun_#t~short18 := test_fun_#t~short14; 54#L557-11 assume test_fun_#t~short18;call test_fun_#t~mem17 := 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);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 57#L557-13 test_fun_#t~short20 := test_fun_#t~short18; 60#L557-14 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 61#L557-16 test_fun_#t~short22 := test_fun_#t~short20; 66#L557-17 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 67#L557-19 assume !!test_fun_#t~short22;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem10;havoc test_fun_#t~short18;havoc test_fun_#t~mem7;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~mem12;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~short9;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 55#L557-21 [2018-11-18 12:14:51,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:51,147 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 12:14:51,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:14:51,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:14:51,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:51,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:51,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:51,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:51,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2005892066, now seen corresponding path program 1 times [2018-11-18 12:14:51,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:14:51,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:14:51,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:51,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:14:51,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:51,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:51,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1074926428, now seen corresponding path program 1 times [2018-11-18 12:14:51,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:14:51,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:14:51,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:51,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:51,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:51,597 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2018-11-18 12:14:51,987 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-18 12:14:52,106 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-18 12:14:52,115 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:14:52,116 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:14:52,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:14:52,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:14:52,116 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:14:52,117 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:14:52,117 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:14:52,117 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:14:52,117 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.06-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-18 12:14:52,117 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:14:52,117 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:14:52,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:52,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-18 12:14:52,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-18 12:14:52,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-18 12:14:52,608 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-18 12:14:52,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:53,073 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:14:53,076 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:14:53,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:14:53,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:14:53,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:14:53,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:14:53,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:14:53,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:53,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:53,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:53,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:14:53,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:14:53,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:14:53,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,221 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:14:53,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,224 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:14:53,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:14:53,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:14:53,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,237 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:14:53,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,238 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:14:53,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:53,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:53,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:53,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:53,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:53,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:53,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:14:53,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:53,265 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:14:53,277 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:14:53,277 INFO L444 ModelExtractionUtils]: 37 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 12:14:53,279 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:14:53,280 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:14:53,280 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:14:53,281 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2018-11-18 12:14:53,406 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-18 12:14:53,412 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:14:53,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:53,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:14:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:53,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:14:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:53,531 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-18 12:14:53,531 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-18 12:14:53,654 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 73 states and 96 transitions. Complement of second has 12 states. [2018-11-18 12:14:53,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 12:14:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 12:14:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-11-18 12:14:53,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-18 12:14:53,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:14:53,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 14 letters. Loop has 12 letters. [2018-11-18 12:14:53,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:14:53,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 24 letters. [2018-11-18 12:14:53,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:14:53,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 96 transitions. [2018-11-18 12:14:53,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-18 12:14:53,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 66 states and 87 transitions. [2018-11-18 12:14:53,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-18 12:14:53,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-18 12:14:53,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 87 transitions. [2018-11-18 12:14:53,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:14:53,660 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 87 transitions. [2018-11-18 12:14:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 87 transitions. [2018-11-18 12:14:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-11-18 12:14:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 12:14:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2018-11-18 12:14:53,663 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-11-18 12:14:53,663 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-11-18 12:14:53,663 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:14:53,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2018-11-18 12:14:53,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-18 12:14:53,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:14:53,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:14:53,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:14:53,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:14:53,664 INFO L794 eck$LassoCheckResult]: Stem: 409#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 405#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 406#L557-21 assume true; 390#L557-1 [2018-11-18 12:14:53,664 INFO L796 eck$LassoCheckResult]: Loop: 390#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 395#L557-2 assume !test_fun_#t~short9; 398#L557-4 test_fun_#t~short14 := test_fun_#t~short9; 407#L557-5 assume test_fun_#t~short14; 384#L557-10 test_fun_#t~short18 := test_fun_#t~short14; 387#L557-11 assume test_fun_#t~short18;call test_fun_#t~mem17 := 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);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 393#L557-13 test_fun_#t~short20 := test_fun_#t~short18; 401#L557-14 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 403#L557-16 test_fun_#t~short22 := test_fun_#t~short20; 414#L557-17 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 416#L557-19 assume !!test_fun_#t~short22;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem10;havoc test_fun_#t~short18;havoc test_fun_#t~mem7;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~mem12;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~short9;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 389#L557-21 assume true; 390#L557-1 [2018-11-18 12:14:53,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:53,665 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 12:14:53,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:14:53,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:14:53,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:53,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:53,685 INFO L82 PathProgramCache]: Analyzing trace with hash 431782850, now seen corresponding path program 1 times [2018-11-18 12:14:53,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:14:53,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:14:53,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:53,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:53,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:14:53,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:14:53,709 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:14:53,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:14:53,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:14:53,710 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-18 12:14:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:14:53,747 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2018-11-18 12:14:53,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:14:53,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 80 transitions. [2018-11-18 12:14:53,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-18 12:14:53,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 80 transitions. [2018-11-18 12:14:53,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 12:14:53,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 12:14:53,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 80 transitions. [2018-11-18 12:14:53,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:14:53,750 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-18 12:14:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 80 transitions. [2018-11-18 12:14:53,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 41. [2018-11-18 12:14:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 12:14:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2018-11-18 12:14:53,754 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-18 12:14:53,754 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-18 12:14:53,754 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:14:53,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2018-11-18 12:14:53,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 12:14:53,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:14:53,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:14:53,755 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:14:53,755 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:14:53,756 INFO L794 eck$LassoCheckResult]: Stem: 522#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 518#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 519#L557-21 assume true; 504#L557-1 [2018-11-18 12:14:53,756 INFO L796 eck$LassoCheckResult]: Loop: 504#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 509#L557-2 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 511#L557-4 test_fun_#t~short14 := test_fun_#t~short9; 520#L557-5 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 523#L557-7 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 496#L557-9 test_fun_#t~short14 := test_fun_#t~short13; 497#L557-10 test_fun_#t~short18 := test_fun_#t~short14; 500#L557-11 assume test_fun_#t~short18;call test_fun_#t~mem17 := 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);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 507#L557-13 test_fun_#t~short20 := test_fun_#t~short18; 514#L557-14 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 516#L557-16 test_fun_#t~short22 := test_fun_#t~short20; 525#L557-17 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 527#L557-19 assume !!test_fun_#t~short22;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem10;havoc test_fun_#t~short18;havoc test_fun_#t~mem7;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~mem12;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~short9;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 503#L557-21 assume true; 504#L557-1 [2018-11-18 12:14:53,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:53,756 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 2 times [2018-11-18 12:14:53,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:14:53,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:14:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:53,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:53,771 INFO L82 PathProgramCache]: Analyzing trace with hash -193704730, now seen corresponding path program 1 times [2018-11-18 12:14:53,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:14:53,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:14:53,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:14:53,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:53,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:14:53,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:14:53,809 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:14:53,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:14:53,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:14:53,809 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-18 12:14:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:14:53,889 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2018-11-18 12:14:53,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:14:53,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 108 transitions. [2018-11-18 12:14:53,891 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2018-11-18 12:14:53,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 108 transitions. [2018-11-18 12:14:53,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-18 12:14:53,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-18 12:14:53,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 108 transitions. [2018-11-18 12:14:53,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:14:53,892 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 108 transitions. [2018-11-18 12:14:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 108 transitions. [2018-11-18 12:14:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-11-18 12:14:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-18 12:14:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2018-11-18 12:14:53,899 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 88 transitions. [2018-11-18 12:14:53,899 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 88 transitions. [2018-11-18 12:14:53,899 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:14:53,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 88 transitions. [2018-11-18 12:14:53,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-18 12:14:53,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:14:53,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:14:53,901 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:14:53,901 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:14:53,901 INFO L794 eck$LassoCheckResult]: Stem: 662#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 658#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 659#L557-21 assume true; 641#L557-1 [2018-11-18 12:14:53,901 INFO L796 eck$LassoCheckResult]: Loop: 641#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 649#L557-2 assume !test_fun_#t~short9; 651#L557-4 test_fun_#t~short14 := test_fun_#t~short9; 663#L557-5 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 664#L557-7 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 634#L557-9 test_fun_#t~short14 := test_fun_#t~short13; 635#L557-10 test_fun_#t~short18 := test_fun_#t~short14; 638#L557-11 assume test_fun_#t~short18;call test_fun_#t~mem17 := 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);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 644#L557-13 test_fun_#t~short20 := test_fun_#t~short18; 654#L557-14 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 656#L557-16 test_fun_#t~short22 := test_fun_#t~short20; 666#L557-17 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 686#L557-19 assume !!test_fun_#t~short22;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem10;havoc test_fun_#t~short18;havoc test_fun_#t~mem7;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~mem12;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~short9;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 640#L557-21 assume true; 641#L557-1 [2018-11-18 12:14:53,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:53,901 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 3 times [2018-11-18 12:14:53,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:14:53,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:14:53,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:53,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:53,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash -780510744, now seen corresponding path program 1 times [2018-11-18 12:14:53,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:14:53,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:14:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:14:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:53,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:53,941 INFO L82 PathProgramCache]: Analyzing trace with hash 444140298, now seen corresponding path program 1 times [2018-11-18 12:14:53,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:14:53,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:14:53,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:53,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:14:54,257 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 87 [2018-11-18 12:14:54,528 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-18 12:14:54,642 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-18 12:14:54,645 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:14:54,645 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:14:54,645 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:14:54,645 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:14:54,645 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:14:54,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:14:54,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:14:54,646 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:14:54,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.06-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-18 12:14:54,646 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:14:54,646 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:14:54,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:54,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:54,900 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2018-11-18 12:14:54,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:54,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:54,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:54,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:54,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:54,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:54,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-18 12:14:54,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-18 12:14:55,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-18 12:14:55,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:55,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-18 12:14:55,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-18 12:14:55,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-18 12:14:55,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-18 12:14:55,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:55,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-18 12:14:55,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-18 12:14:55,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-18 12:14:55,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-18 12:14:55,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:55,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:55,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:55,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:55,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:55,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:55,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:55,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:55,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:14:55,382 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:14:55,382 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:14:55,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:55,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:55,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:14:55,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:55,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:55,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:55,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:14:55,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:14:55,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:14:55,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:14:55,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:14:55,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:14:55,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:14:55,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:14:55,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:14:55,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:14:55,397 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:14:55,403 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:14:55,403 INFO L444 ModelExtractionUtils]: 37 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 12:14:55,403 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:14:55,404 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:14:55,404 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:14:55,404 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 4294967293 Supporting invariants [] [2018-11-18 12:14:55,522 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-18 12:14:55,523 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:14:55,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:55,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:14:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:55,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:14:55,640 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,645 INFO L477 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 0 case distinctions, treesize of input 70 treesize of output 58 [2018-11-18 12:14:55,652 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-11-18 12:14:55,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,669 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,670 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2018-11-18 12:14:55,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-18 12:14:55,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,695 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,713 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 73 [2018-11-18 12:14:55,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2018-11-18 12:14:55,721 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 58 [2018-11-18 12:14:55,787 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,827 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-11-18 12:14:55,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-18 12:14:55,831 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,837 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,863 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,874 INFO L477 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 40 treesize of output 59 [2018-11-18 12:14:55,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-18 12:14:55,883 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-18 12:14:55,914 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,931 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:14:55,946 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-11-18 12:14:55,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-18 12:14:55,954 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-18 12:14:55,965 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:14:55,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-18 12:14:55,966 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,978 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,981 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:14:55,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:14:55,995 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 3 variables, input treesize:78, output treesize:39 [2018-11-18 12:14:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:56,006 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 12:14:56,007 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 88 transitions. cyclomatic complexity: 23 Second operand 5 states. [2018-11-18 12:14:56,033 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 88 transitions. cyclomatic complexity: 23. Second operand 5 states. Result 135 states and 175 transitions. Complement of second has 6 states. [2018-11-18 12:14:56,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:14:56,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 12:14:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-18 12:14:56,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 3 letters. Loop has 14 letters. [2018-11-18 12:14:56,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:14:56,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 17 letters. Loop has 14 letters. [2018-11-18 12:14:56,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:14:56,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 3 letters. Loop has 28 letters. [2018-11-18 12:14:56,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:14:56,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 175 transitions. [2018-11-18 12:14:56,037 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:14:56,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 0 states and 0 transitions. [2018-11-18 12:14:56,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:14:56,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:14:56,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:14:56,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:14:56,037 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:14:56,037 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:14:56,038 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:14:56,038 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:14:56,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:14:56,038 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:14:56,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:14:56,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:14:56 BoogieIcfgContainer [2018-11-18 12:14:56,042 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:14:56,043 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:14:56,043 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:14:56,043 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:14:56,043 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:14:50" (3/4) ... [2018-11-18 12:14:56,045 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:14:56,045 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:14:56,046 INFO L168 Benchmark]: Toolchain (without parser) took 5886.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.2 MB). Free memory was 955.4 MB in the beginning and 1.3 GB in the end (delta: -367.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:14:56,046 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:14:56,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -201.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:14:56,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:14:56,047 INFO L168 Benchmark]: Boogie Preprocessor took 18.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:14:56,048 INFO L168 Benchmark]: RCFGBuilder took 238.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:14:56,048 INFO L168 Benchmark]: BuchiAutomizer took 5237.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -200.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:14:56,048 INFO L168 Benchmark]: Witness Printer took 2.78 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:14:56,051 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -201.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 238.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5237.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -200.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.78 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 7 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 59 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 69 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 171 SDslu, 132 SDs, 0 SdLazy, 146 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital446 mio100 ax104 hnf100 lsp94 ukn52 mio100 lsp37 div100 bol100 ite100 ukn100 eq190 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...