./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash abee338f12eaa8176313da7ed567414f687b7fa7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:31:20,056 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:31:20,058 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:31:20,069 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:31:20,070 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:31:20,071 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:31:20,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:31:20,079 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:31:20,081 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:31:20,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:31:20,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:31:20,083 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:31:20,087 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:31:20,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:31:20,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:31:20,094 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:31:20,096 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:31:20,099 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:31:20,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:31:20,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:31:20,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:31:20,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:31:20,116 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:31:20,117 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:31:20,117 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:31:20,118 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:31:20,119 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:31:20,120 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:31:20,121 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:31:20,122 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:31:20,122 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:31:20,123 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:31:20,124 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:31:20,124 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:31:20,125 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:31:20,125 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:31:20,126 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:31:20,141 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:31:20,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:31:20,142 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:31:20,142 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:31:20,142 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:31:20,142 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:31:20,143 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:31:20,143 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:31:20,143 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:31:20,143 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:31:20,143 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:31:20,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:31:20,144 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:31:20,144 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:31:20,144 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:31:20,144 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:31:20,144 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:31:20,145 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:31:20,145 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:31:20,145 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:31:20,145 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:31:20,145 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:31:20,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:31:20,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:31:20,146 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:31:20,146 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:31:20,146 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:31:20,146 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:31:20,147 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:31:20,148 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> abee338f12eaa8176313da7ed567414f687b7fa7 [2019-01-14 02:31:20,180 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:31:20,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:31:20,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:31:20,202 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:31:20,203 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:31:20,203 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:31:20,271 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119ad1eeb/82ba3f2264ff4b79868343d0d1c8b153/FLAG1540ea488 [2019-01-14 02:31:20,747 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:31:20,748 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:31:20,762 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119ad1eeb/82ba3f2264ff4b79868343d0d1c8b153/FLAG1540ea488 [2019-01-14 02:31:21,060 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119ad1eeb/82ba3f2264ff4b79868343d0d1c8b153 [2019-01-14 02:31:21,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:31:21,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:31:21,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:31:21,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:31:21,069 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:31:21,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:31:21" (1/1) ... [2019-01-14 02:31:21,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bf390c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21, skipping insertion in model container [2019-01-14 02:31:21,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:31:21" (1/1) ... [2019-01-14 02:31:21,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:31:21,118 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:31:21,487 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:31:21,507 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:31:21,565 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:31:21,634 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:31:21,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21 WrapperNode [2019-01-14 02:31:21,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:31:21,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:31:21,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:31:21,636 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:31:21,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21" (1/1) ... [2019-01-14 02:31:21,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21" (1/1) ... [2019-01-14 02:31:21,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:31:21,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:31:21,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:31:21,752 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:31:21,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21" (1/1) ... [2019-01-14 02:31:21,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21" (1/1) ... [2019-01-14 02:31:21,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21" (1/1) ... [2019-01-14 02:31:21,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21" (1/1) ... [2019-01-14 02:31:21,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21" (1/1) ... [2019-01-14 02:31:21,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21" (1/1) ... [2019-01-14 02:31:21,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21" (1/1) ... [2019-01-14 02:31:21,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:31:21,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:31:21,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:31:21,790 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:31:21,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:31:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:31:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:31:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:31:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:31:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:31:21,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:31:22,282 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:31:22,283 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-14 02:31:22,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:31:22 BoogieIcfgContainer [2019-01-14 02:31:22,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:31:22,285 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:31:22,285 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:31:22,289 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:31:22,290 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:31:22,290 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:31:21" (1/3) ... [2019-01-14 02:31:22,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@640ddd24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:31:22, skipping insertion in model container [2019-01-14 02:31:22,292 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:31:22,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:31:21" (2/3) ... [2019-01-14 02:31:22,293 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@640ddd24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:31:22, skipping insertion in model container [2019-01-14 02:31:22,293 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:31:22,293 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:31:22" (3/3) ... [2019-01-14 02:31:22,296 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.18-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:31:22,349 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:31:22,349 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:31:22,349 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:31:22,350 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:31:22,350 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:31:22,350 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:31:22,350 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:31:22,350 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:31:22,350 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:31:22,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 02:31:22,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:31:22,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:22,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:22,390 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:22,390 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:31:22,391 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:31:22,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 02:31:22,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:31:22,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:22,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:22,393 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:22,394 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:31:22,402 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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); 8#L559-4true [2019-01-14 02:31:22,402 INFO L796 eck$LassoCheckResult]: Loop: 8#L559-4true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 14#L553-1true assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 18#L553-3true assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 9#L554true assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 6#L559-3true assume !true; 8#L559-4true [2019-01-14 02:31:22,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:22,409 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:31:22,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:22,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:22,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:22,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:22,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:22,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:22,542 INFO L82 PathProgramCache]: Analyzing trace with hash 35410170, now seen corresponding path program 1 times [2019-01-14 02:31:22,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:22,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:22,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:22,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:22,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:22,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:22,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 02:31:22,591 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:31:22,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:31:22,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:31:22,605 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-01-14 02:31:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:22,612 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-01-14 02:31:22,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:31:22,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-01-14 02:31:22,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:31:22,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 10 states and 14 transitions. [2019-01-14 02:31:22,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:31:22,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:31:22,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2019-01-14 02:31:22,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:31:22,622 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-01-14 02:31:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2019-01-14 02:31:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 02:31:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:31:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-01-14 02:31:22,648 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-01-14 02:31:22,648 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-01-14 02:31:22,648 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:31:22,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2019-01-14 02:31:22,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:31:22,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:22,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:22,649 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:22,649 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:31:22,650 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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); 43#L559-4 [2019-01-14 02:31:22,650 INFO L796 eck$LassoCheckResult]: Loop: 43#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 49#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 50#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 51#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 45#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 44#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 43#L559-4 [2019-01-14 02:31:22,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:22,650 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 02:31:22,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:22,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:22,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:22,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:22,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:22,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1097715097, now seen corresponding path program 1 times [2019-01-14 02:31:22,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:22,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:22,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:22,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:22,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:22,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:22,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:31:22,864 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:31:22,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:31:22,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:31:22,865 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-01-14 02:31:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:23,085 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-01-14 02:31:23,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:31:23,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-01-14 02:31:23,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:31:23,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2019-01-14 02:31:23,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 02:31:23,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:31:23,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-01-14 02:31:23,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:31:23,089 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 02:31:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-01-14 02:31:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-01-14 02:31:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:31:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-14 02:31:23,092 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:31:23,092 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:31:23,092 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:31:23,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-14 02:31:23,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 02:31:23,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:23,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:23,094 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:23,094 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:31:23,094 INFO L794 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 79#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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); 80#L559-4 [2019-01-14 02:31:23,094 INFO L796 eck$LassoCheckResult]: Loop: 80#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 86#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 87#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 89#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 84#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 85#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 80#L559-4 [2019-01-14 02:31:23,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:23,095 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-14 02:31:23,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:23,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:23,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:23,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:23,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:23,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:23,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1097700202, now seen corresponding path program 1 times [2019-01-14 02:31:23,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:23,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:23,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:23,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:23,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:23,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:23,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:31:23,231 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:31:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:31:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:31:23,231 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-01-14 02:31:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:23,313 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-01-14 02:31:23,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:31:23,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-01-14 02:31:23,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-14 02:31:23,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-01-14 02:31:23,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 02:31:23,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 02:31:23,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-01-14 02:31:23,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:31:23,317 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 02:31:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-01-14 02:31:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-14 02:31:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 02:31:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-01-14 02:31:23,319 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 02:31:23,319 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 02:31:23,320 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:31:23,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-01-14 02:31:23,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 02:31:23,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:23,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:23,321 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:23,321 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:31:23,322 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 116#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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); 117#L559-4 [2019-01-14 02:31:23,322 INFO L796 eck$LassoCheckResult]: Loop: 117#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 121#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 122#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 126#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 123#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 124#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 128#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 129#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 117#L559-4 [2019-01-14 02:31:23,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:23,322 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-01-14 02:31:23,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:23,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:23,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:23,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:23,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:23,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1672057937, now seen corresponding path program 1 times [2019-01-14 02:31:23,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:23,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:23,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:23,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:23,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:23,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:31:23,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:31:23,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:23,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:23,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:23,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2019-01-14 02:31:23,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:23,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2019-01-14 02:31:23,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:23,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:23,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:23,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:23,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2019-01-14 02:31:23,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:24,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:24,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 02:31:24,165 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 [2019-01-14 02:31:24,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-01-14 02:31:24,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-01-14 02:31:24,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:24,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:24,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-01-14 02:31:24,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 02:31:24,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:24,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 02:31:24,618 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:24,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:24,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:24,655 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:61, output treesize:3 [2019-01-14 02:31:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:24,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:31:24,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-01-14 02:31:24,678 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:31:24,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:31:24,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:31:24,679 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2019-01-14 02:31:24,913 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 02:31:25,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:25,093 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-01-14 02:31:25,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:31:25,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-01-14 02:31:25,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 02:31:25,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2019-01-14 02:31:25,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 02:31:25,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 02:31:25,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-01-14 02:31:25,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:31:25,098 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:31:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-01-14 02:31:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 02:31:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:31:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-01-14 02:31:25,102 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:31:25,102 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:31:25,102 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:31:25,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-01-14 02:31:25,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 02:31:25,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:25,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:25,105 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:31:25,105 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:31:25,106 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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); 191#L559-4 [2019-01-14 02:31:25,106 INFO L796 eck$LassoCheckResult]: Loop: 191#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 195#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 196#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 200#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 201#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 192#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 193#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 199#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 191#L559-4 [2019-01-14 02:31:25,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:25,106 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-01-14 02:31:25,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:25,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:25,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:25,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:25,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1657743362, now seen corresponding path program 1 times [2019-01-14 02:31:25,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:25,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:25,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:25,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:25,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:25,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash -967181888, now seen corresponding path program 1 times [2019-01-14 02:31:25,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:25,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:25,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:25,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:25,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:25,418 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-01-14 02:31:25,689 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-01-14 02:31:25,793 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:31:25,804 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:31:25,805 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:31:25,805 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:31:25,806 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:31:25,806 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:31:25,806 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:31:25,806 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:31:25,806 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:31:25,806 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2019-01-14 02:31:25,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:31:25,807 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:31:25,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:25,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:26,169 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-01-14 02:31:26,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:26,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:26,942 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:31:27,083 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:31:27,088 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:31:27,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 [2019-01-14 02:31:27,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,098 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 [2019-01-14 02:31:27,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,102 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 [2019-01-14 02:31:27,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,105 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 [2019-01-14 02:31:27,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,108 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 [2019-01-14 02:31:27,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:27,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:27,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,117 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 [2019-01-14 02:31:27,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,123 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 [2019-01-14 02:31:27,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,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 [2019-01-14 02:31:27,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:27,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:27,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:27,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:27,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:27,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,145 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 [2019-01-14 02:31:27,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,150 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 [2019-01-14 02:31:27,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:27,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,161 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 [2019-01-14 02:31:27,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:27,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:27,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,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 [2019-01-14 02:31:27,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,174 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 [2019-01-14 02:31:27,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,180 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 [2019-01-14 02:31:27,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,186 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 [2019-01-14 02:31:27,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,192 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 [2019-01-14 02:31:27,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,197 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 [2019-01-14 02:31:27,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,203 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 [2019-01-14 02:31:27,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:27,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:27,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,211 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 [2019-01-14 02:31:27,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:27,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:27,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:27,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,216 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 [2019-01-14 02:31:27,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:27,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:27,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,230 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 [2019-01-14 02:31:27,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:27,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:27,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,243 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 [2019-01-14 02:31:27,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,244 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:31:27,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,249 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:31:27,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:27,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:27,266 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 [2019-01-14 02:31:27,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:27,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:27,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:27,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:27,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:27,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:27,293 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:31:27,314 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:31:27,314 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:31:27,318 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:31:27,319 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:31:27,319 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:31:27,320 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2019-01-14 02:31:27,482 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:31:27,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:31:27,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:27,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:27,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:27,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-01-14 02:31:27,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-14 02:31:27,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:27,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:27,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 02:31:27,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 02:31:27,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:27,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:27,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:27,588 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:6 [2019-01-14 02:31:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:31:27,626 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:31:27,627 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-01-14 02:31:27,888 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 40 states and 53 transitions. Complement of second has 10 states. [2019-01-14 02:31:27,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:31:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:31:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-01-14 02:31:27,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-14 02:31:27,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:27,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-14 02:31:27,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:27,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 16 letters. [2019-01-14 02:31:27,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:27,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2019-01-14 02:31:27,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-14 02:31:27,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 51 transitions. [2019-01-14 02:31:27,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:31:27,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 02:31:27,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2019-01-14 02:31:27,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:27,899 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2019-01-14 02:31:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2019-01-14 02:31:27,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-01-14 02:31:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 02:31:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-01-14 02:31:27,906 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-14 02:31:27,906 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-14 02:31:27,906 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:31:27,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-01-14 02:31:27,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-14 02:31:27,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:27,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:27,909 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:31:27,909 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1] [2019-01-14 02:31:27,909 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 354#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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); 355#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 367#L553-1 [2019-01-14 02:31:27,909 INFO L796 eck$LassoCheckResult]: Loop: 367#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 368#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 371#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 363#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 364#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 373#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 380#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 379#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 378#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 357#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 367#L553-1 [2019-01-14 02:31:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:27,910 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:31:27,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:27,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:27,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:27,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:27,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:27,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:27,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1479493138, now seen corresponding path program 2 times [2019-01-14 02:31:27,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:27,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:27,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:27,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:27,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:27,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:27,974 INFO L82 PathProgramCache]: Analyzing trace with hash 376307409, now seen corresponding path program 1 times [2019-01-14 02:31:27,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:27,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:27,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:27,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:27,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:28,524 WARN L181 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-01-14 02:31:28,631 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-14 02:31:28,860 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-01-14 02:31:29,143 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-14 02:31:29,147 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:31:29,147 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:31:29,147 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:31:29,147 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:31:29,147 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:31:29,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:31:29,148 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:31:29,148 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:31:29,148 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration6_Lasso [2019-01-14 02:31:29,148 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:31:29,148 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:31:29,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:29,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:30,034 WARN L181 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-01-14 02:31:30,160 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-01-14 02:31:30,443 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-01-14 02:31:30,869 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-01-14 02:31:31,056 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:31:31,070 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:31:31,070 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:31:31,070 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 [2019-01-14 02:31:31,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,076 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 [2019-01-14 02:31:31,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,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 [2019-01-14 02:31:31,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,087 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 [2019-01-14 02:31:31,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:31,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:31,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,094 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 [2019-01-14 02:31:31,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:31,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:31,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,103 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 [2019-01-14 02:31:31,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:31,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:31,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,113 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 [2019-01-14 02:31:31,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,119 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 [2019-01-14 02:31:31,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,127 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 [2019-01-14 02:31:31,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,141 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 [2019-01-14 02:31:31,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,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 [2019-01-14 02:31:31,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,151 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 [2019-01-14 02:31:31,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:31,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:31,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,156 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 [2019-01-14 02:31:31,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,158 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 [2019-01-14 02:31:31,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,160 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 [2019-01-14 02:31:31,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,163 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 [2019-01-14 02:31:31,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:31,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:31,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,166 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 [2019-01-14 02:31:31,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,172 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 [2019-01-14 02:31:31,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:31,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,177 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 [2019-01-14 02:31:31,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:31,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:31,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:31,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,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 [2019-01-14 02:31:31,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:31,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:31,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,188 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 [2019-01-14 02:31:31,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:31,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:31,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,202 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 [2019-01-14 02:31:31,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:31,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:31,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:31,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:31,211 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 [2019-01-14 02:31:31,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:31,212 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:31:31,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:31,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:31,222 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:31:31,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:31,268 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:31:31,292 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:31:31,292 INFO L444 ModelExtractionUtils]: 31 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:31:31,292 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:31:31,293 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:31:31,294 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:31:31,294 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite ULTIMATE.start_test_fun_#t~short6 1 0)_2) = 1*v_rep(ite ULTIMATE.start_test_fun_#t~short6 1 0)_2 Supporting invariants [] [2019-01-14 02:31:31,442 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:31:31,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:31,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:31,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 02:31:31,548 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:31:31,548 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-01-14 02:31:31,689 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 73 states and 98 transitions. Complement of second has 10 states. [2019-01-14 02:31:31,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:31:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:31:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-01-14 02:31:31,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 3 letters. Loop has 10 letters. [2019-01-14 02:31:31,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:31,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 13 letters. Loop has 10 letters. [2019-01-14 02:31:31,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:31,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 3 letters. Loop has 20 letters. [2019-01-14 02:31:31,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:31,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 98 transitions. [2019-01-14 02:31:31,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:31:31,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 65 states and 89 transitions. [2019-01-14 02:31:31,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 02:31:31,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 02:31:31,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 89 transitions. [2019-01-14 02:31:31,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:31,699 INFO L706 BuchiCegarLoop]: Abstraction has 65 states and 89 transitions. [2019-01-14 02:31:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 89 transitions. [2019-01-14 02:31:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2019-01-14 02:31:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-14 02:31:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2019-01-14 02:31:31,706 INFO L729 BuchiCegarLoop]: Abstraction has 55 states and 79 transitions. [2019-01-14 02:31:31,706 INFO L609 BuchiCegarLoop]: Abstraction has 55 states and 79 transitions. [2019-01-14 02:31:31,707 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:31:31,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 79 transitions. [2019-01-14 02:31:31,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:31:31,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:31,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:31,708 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:31:31,709 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:31:31,709 INFO L794 eck$LassoCheckResult]: Stem: 579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 571#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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); 572#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 615#L553-1 assume !test_fun_#t~short6; 585#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 590#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 580#L555-3 [2019-01-14 02:31:31,709 INFO L796 eck$LassoCheckResult]: Loop: 580#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 581#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 580#L555-3 [2019-01-14 02:31:31,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:31,709 INFO L82 PathProgramCache]: Analyzing trace with hash 889571371, now seen corresponding path program 1 times [2019-01-14 02:31:31,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:31,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:31,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:31,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:31,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:31,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:31:31,771 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:31:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:31,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2019-01-14 02:31:31,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:31,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:31,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:31,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:31,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:31,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:31:31,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:31:31,839 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. cyclomatic complexity: 30 Second operand 3 states. [2019-01-14 02:31:31,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:31,850 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2019-01-14 02:31:31,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:31:31,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 75 transitions. [2019-01-14 02:31:31,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:31:31,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 53 states and 67 transitions. [2019-01-14 02:31:31,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:31:31,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:31:31,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2019-01-14 02:31:31,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:31,857 INFO L706 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-01-14 02:31:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2019-01-14 02:31:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-14 02:31:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 02:31:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2019-01-14 02:31:31,863 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-01-14 02:31:31,864 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-01-14 02:31:31,864 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:31:31,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 67 transitions. [2019-01-14 02:31:31,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:31:31,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:31,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:31,867 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:31:31,868 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:31:31,868 INFO L794 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 691#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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); 692#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 737#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 705#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 710#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 700#L555-3 [2019-01-14 02:31:31,868 INFO L796 eck$LassoCheckResult]: Loop: 700#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 701#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 700#L555-3 [2019-01-14 02:31:31,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:31,868 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2019-01-14 02:31:31,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:31,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:31,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:31,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:31,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:31,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:31,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2019-01-14 02:31:31,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:31,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:31,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:31,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:31,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:31,895 INFO L82 PathProgramCache]: Analyzing trace with hash 177749422, now seen corresponding path program 1 times [2019-01-14 02:31:31,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:31,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:31,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:31,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:31,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:32,081 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 02:31:32,484 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-01-14 02:31:32,603 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:31:32,603 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:31:32,603 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:31:32,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:31:32,604 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:31:32,604 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:31:32,604 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:31:32,604 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:31:32,604 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2019-01-14 02:31:32,604 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:31:32,604 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:31:32,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:32,872 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-14 02:31:33,330 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:31:33,426 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:31:33,426 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:31:33,427 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 [2019-01-14 02:31:33,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,433 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 [2019-01-14 02:31:33,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,437 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 [2019-01-14 02:31:33,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,443 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 [2019-01-14 02:31:33,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:33,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:33,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:33,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,452 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 [2019-01-14 02:31:33,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:33,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:33,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,463 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 [2019-01-14 02:31:33,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,465 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 [2019-01-14 02:31:33,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:33,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:33,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:33,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:33,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:33,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,485 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 [2019-01-14 02:31:33,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,492 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 [2019-01-14 02:31:33,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,494 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 [2019-01-14 02:31:33,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,498 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 [2019-01-14 02:31:33,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,501 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 [2019-01-14 02:31:33,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,502 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 [2019-01-14 02:31:33,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:33,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:33,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,506 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 [2019-01-14 02:31:33,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,508 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 [2019-01-14 02:31:33,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,515 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 [2019-01-14 02:31:33,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:33,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:33,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:33,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:33,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,527 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 [2019-01-14 02:31:33,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:33,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:33,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:33,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:33,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:33,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,548 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 [2019-01-14 02:31:33,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:33,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:33,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,560 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 [2019-01-14 02:31:33,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,564 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:31:33,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,566 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:31:33,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:33,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:33,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:33,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:33,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:33,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:33,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:33,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:33,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:33,613 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:31:33,621 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:31:33,622 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:31:33,622 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:31:33,623 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:31:33,623 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:31:33,623 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2019-01-14 02:31:33,914 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2019-01-14 02:31:33,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:31:33,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:33,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:33,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:34,008 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:31:34,009 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-01-14 02:31:34,059 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 149 states and 188 transitions. Complement of second has 6 states. [2019-01-14 02:31:34,062 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 [2019-01-14 02:31:34,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:31:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-14 02:31:34,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:31:34,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:34,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:31:34,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:34,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:31:34,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:34,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 188 transitions. [2019-01-14 02:31:34,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:31:34,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 56 states and 67 transitions. [2019-01-14 02:31:34,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:31:34,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:31:34,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-01-14 02:31:34,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:34,068 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-14 02:31:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-01-14 02:31:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-01-14 02:31:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 02:31:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-01-14 02:31:34,071 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-14 02:31:34,072 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-14 02:31:34,072 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:31:34,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2019-01-14 02:31:34,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:31:34,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:34,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:34,073 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:31:34,073 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:31:34,073 INFO L794 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 980#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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); 981#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 993#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1002#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1001#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1000#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 999#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 997#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 982#L559-1 [2019-01-14 02:31:34,073 INFO L796 eck$LassoCheckResult]: Loop: 982#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 983#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 982#L559-1 [2019-01-14 02:31:34,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:34,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1215726572, now seen corresponding path program 1 times [2019-01-14 02:31:34,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:34,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:34,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:34,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:34,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:34,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 1 times [2019-01-14 02:31:34,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:34,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:34,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:34,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:34,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash 82132647, now seen corresponding path program 2 times [2019-01-14 02:31:34,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:34,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:34,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:34,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:34,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:34,282 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 02:31:34,458 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 02:31:35,311 WARN L181 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-01-14 02:31:35,416 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 02:31:35,419 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:31:35,420 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:31:35,420 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:31:35,420 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:31:35,420 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:31:35,420 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:31:35,420 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:31:35,420 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:31:35,420 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration9_Lasso [2019-01-14 02:31:35,420 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:31:35,420 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:31:35,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,657 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-14 02:31:35,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:35,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:36,036 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-14 02:31:36,355 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:31:36,516 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:31:36,516 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:31:36,517 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 [2019-01-14 02:31:36,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:36,517 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:31:36,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:36,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:36,525 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:31:36,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:36,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:36,534 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 [2019-01-14 02:31:36,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:36,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:36,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:36,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:36,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:36,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:36,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:36,549 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 [2019-01-14 02:31:36,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:36,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:36,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:36,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:36,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:36,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:36,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:36,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:36,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:36,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:36,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:36,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:36,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:36,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:36,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:36,569 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 [2019-01-14 02:31:36,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:36,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:36,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:36,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:36,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:36,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:36,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:36,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:36,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:36,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:36,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:36,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:36,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:36,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:36,602 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:31:36,618 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:31:36,619 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:31:36,620 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:31:36,621 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:31:36,621 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:31:36,621 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 Supporting invariants [-1*ULTIMATE.start_test_fun_#t~mem11 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 >= 0] [2019-01-14 02:31:36,732 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:31:36,735 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:31:36,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:36,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:36,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:36,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:36,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2019-01-14 02:31:36,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:36,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:31:36,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:36,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:36,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:36,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-01-14 02:31:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:36,868 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:31:36,868 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 02:31:36,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 61 states and 75 transitions. Complement of second has 6 states. [2019-01-14 02:31:36,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2019-01-14 02:31:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:31:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-14 02:31:36,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:31:36,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:36,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-14 02:31:36,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:36,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 02:31:36,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:36,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 75 transitions. [2019-01-14 02:31:36,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:31:36,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 56 states and 69 transitions. [2019-01-14 02:31:36,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:31:36,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:31:36,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 69 transitions. [2019-01-14 02:31:36,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:36,913 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2019-01-14 02:31:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 69 transitions. [2019-01-14 02:31:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-01-14 02:31:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 02:31:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-01-14 02:31:36,917 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-01-14 02:31:36,917 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-01-14 02:31:36,917 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:31:36,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 65 transitions. [2019-01-14 02:31:36,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:31:36,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:36,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:36,919 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1] [2019-01-14 02:31:36,919 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:31:36,919 INFO L794 eck$LassoCheckResult]: Stem: 1185#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1179#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(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.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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); 1180#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1194#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1192#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1193#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1191#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1183#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1184#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1207#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 1206#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1205#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1204#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~short6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1203#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1202#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1201#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1199#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1181#L559-1 [2019-01-14 02:31:36,919 INFO L796 eck$LassoCheckResult]: Loop: 1181#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1182#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1181#L559-1 [2019-01-14 02:31:36,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:36,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2055714993, now seen corresponding path program 2 times [2019-01-14 02:31:36,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:36,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:36,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:36,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:36,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:31:37,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:37,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:31:37,155 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:31:37,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:37,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 2 times [2019-01-14 02:31:37,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:37,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:37,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:37,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:37,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:37,341 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 02:31:37,514 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 02:31:37,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:31:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:31:37,515 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-01-14 02:31:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:37,656 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-01-14 02:31:37,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:31:37,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2019-01-14 02:31:37,657 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:31:37,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2019-01-14 02:31:37,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:31:37,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:31:37,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:31:37,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:31:37,658 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:31:37,658 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:31:37,658 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:31:37,658 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:31:37,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:31:37,658 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:31:37,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:31:37,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:31:37 BoogieIcfgContainer [2019-01-14 02:31:37,668 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:31:37,668 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:31:37,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:31:37,669 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:31:37,669 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:31:22" (3/4) ... [2019-01-14 02:31:37,676 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:31:37,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:31:37,676 INFO L168 Benchmark]: Toolchain (without parser) took 16612.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -123.9 MB). Peak memory consumption was 193.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:37,680 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:31:37,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 569.79 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:37,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -208.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:37,682 INFO L168 Benchmark]: Boogie Preprocessor took 34.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:31:37,683 INFO L168 Benchmark]: RCFGBuilder took 498.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:37,683 INFO L168 Benchmark]: BuchiAutomizer took 15383.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 211.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:37,684 INFO L168 Benchmark]: Witness Printer took 7.26 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:31:37,688 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 569.79 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 115.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -208.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 498.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15383.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 211.8 MB. Max. memory is 11.5 GB. * Witness Printer took 7.26 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function (if aux-(*x_ref > 0) && (*y_ref > 0)-aux then 1 else 0) and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.3s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 13.2s. Construction of modules took 0.7s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 53 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 8/8 HoareTripleCheckerStatistics: 117 SDtfs, 89 SDslu, 103 SDs, 0 SdLazy, 236 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax107 hnf99 lsp81 ukn75 mio100 lsp32 div100 bol103 ite100 ukn100 eq176 hnf89 smp96 dnf191 smp85 tf100 neg94 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...