./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f5878942b695ddbfe46daa43f5d95028455ef120 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 14:13:54,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:13:54,079 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:13:54,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:13:54,086 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:13:54,087 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:13:54,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:13:54,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:13:54,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:13:54,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:13:54,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:13:54,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:13:54,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:13:54,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:13:54,093 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:13:54,094 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:13:54,095 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:13:54,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:13:54,098 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:13:54,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:13:54,100 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:13:54,100 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:13:54,102 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:13:54,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:13:54,103 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:13:54,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:13:54,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:13:54,105 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:13:54,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:13:54,106 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:13:54,106 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:13:54,106 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:13:54,107 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:13:54,107 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:13:54,107 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:13:54,108 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:13:54,108 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 14:13:54,118 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:13:54,119 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:13:54,119 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:13:54,119 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:13:54,120 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:13:54,120 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 14:13:54,120 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 14:13:54,120 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 14:13:54,120 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 14:13:54,120 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 14:13:54,120 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 14:13:54,120 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:13:54,121 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 14:13:54,121 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:13:54,121 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:13:54,121 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 14:13:54,121 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 14:13:54,121 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 14:13:54,121 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:13:54,121 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 14:13:54,121 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:13:54,122 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 14:13:54,122 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:13:54,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:13:54,122 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 14:13:54,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:13:54,122 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:13:54,122 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 14:13:54,123 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 14:13:54,123 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5878942b695ddbfe46daa43f5d95028455ef120 [2018-11-18 14:13:54,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:13:54,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:13:54,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:13:54,155 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:13:54,155 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:13:54,155 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-18 14:13:54,190 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer/data/ce07398fc/6c72924dd27e43708fb5cc5eff4f027d/FLAG8fc881ec8 [2018-11-18 14:13:54,611 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:13:54,611 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-18 14:13:54,617 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer/data/ce07398fc/6c72924dd27e43708fb5cc5eff4f027d/FLAG8fc881ec8 [2018-11-18 14:13:54,626 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer/data/ce07398fc/6c72924dd27e43708fb5cc5eff4f027d [2018-11-18 14:13:54,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:13:54,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:13:54,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:13:54,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:13:54,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:13:54,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:13:54" (1/1) ... [2018-11-18 14:13:54,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3270d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54, skipping insertion in model container [2018-11-18 14:13:54,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:13:54" (1/1) ... [2018-11-18 14:13:54,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:13:54,669 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:13:54,860 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:13:54,867 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:13:54,894 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:13:54,959 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:13:54,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54 WrapperNode [2018-11-18 14:13:54,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:13:54,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:13:54,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:13:54,960 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:13:54,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54" (1/1) ... [2018-11-18 14:13:54,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54" (1/1) ... [2018-11-18 14:13:54,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:13:54,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:13:54,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:13:54,989 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:13:54,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54" (1/1) ... [2018-11-18 14:13:54,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54" (1/1) ... [2018-11-18 14:13:54,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54" (1/1) ... [2018-11-18 14:13:54,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54" (1/1) ... [2018-11-18 14:13:54,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54" (1/1) ... [2018-11-18 14:13:55,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54" (1/1) ... [2018-11-18 14:13:55,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54" (1/1) ... [2018-11-18 14:13:55,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:13:55,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:13:55,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:13:55,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:13:55,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:13:55,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 14:13:55,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 14:13:55,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 14:13:55,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 14:13:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:13:55,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:13:55,231 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:13:55,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:13:55 BoogieIcfgContainer [2018-11-18 14:13:55,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:13:55,232 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 14:13:55,232 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 14:13:55,235 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 14:13:55,235 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:13:55,236 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 02:13:54" (1/3) ... [2018-11-18 14:13:55,237 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13014a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:13:55, skipping insertion in model container [2018-11-18 14:13:55,237 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:13:55,237 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:13:54" (2/3) ... [2018-11-18 14:13:55,237 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13014a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:13:55, skipping insertion in model container [2018-11-18 14:13:55,237 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:13:55,237 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:13:55" (3/3) ... [2018-11-18 14:13:55,239 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-18 14:13:55,287 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:13:55,287 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 14:13:55,287 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 14:13:55,288 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 14:13:55,288 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:13:55,288 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:13:55,288 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 14:13:55,288 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:13:55,288 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 14:13:55,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 14:13:55,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 14:13:55,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:13:55,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:13:55,324 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:13:55,324 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:13:55,324 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 14:13:55,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 14:13:55,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 14:13:55,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:13:55,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:13:55,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:13:55,326 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:13:55,332 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 13#L555-4true [2018-11-18 14:13:55,333 INFO L796 eck$LassoCheckResult]: Loop: 13#L555-4true assume true; 6#L555-1true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 8#L555-2true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 9#L557-4true assume !true; 11#L557-5true call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 13#L555-4true [2018-11-18 14:13:55,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:55,338 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 14:13:55,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:55,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:55,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:13:55,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:55,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:55,458 INFO L82 PathProgramCache]: Analyzing trace with hash 34421932, now seen corresponding path program 1 times [2018-11-18 14:13:55,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:55,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:55,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:13:55,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:13:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:13:55,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:13:55,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:13:55,490 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:13:55,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 14:13:55,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 14:13:55,502 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-18 14:13:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:13:55,506 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-18 14:13:55,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 14:13:55,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2018-11-18 14:13:55,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 14:13:55,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 10 transitions. [2018-11-18 14:13:55,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 14:13:55,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 14:13:55,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-11-18 14:13:55,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:13:55,515 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-18 14:13:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-11-18 14:13:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-18 14:13:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 14:13:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-18 14:13:55,536 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-18 14:13:55,536 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-18 14:13:55,537 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 14:13:55,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-18 14:13:55,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 14:13:55,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:13:55,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:13:55,538 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:13:55,538 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:13:55,538 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 37#L555-4 [2018-11-18 14:13:55,538 INFO L796 eck$LassoCheckResult]: Loop: 37#L555-4 assume true; 43#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 38#L555-2 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 39#L557-4 assume true; 40#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 44#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 42#L557-5 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 37#L555-4 [2018-11-18 14:13:55,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:55,539 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 14:13:55,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:55,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:55,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:13:55,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:55,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:55,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1280537774, now seen corresponding path program 1 times [2018-11-18 14:13:55,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:55,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:55,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:13:55,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:55,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:55,588 INFO L82 PathProgramCache]: Analyzing trace with hash 265759056, now seen corresponding path program 1 times [2018-11-18 14:13:55,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:55,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:55,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:13:55,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:13:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:13:55,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:13:55,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:13:55,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:13:55,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:13:55,764 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-18 14:13:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:13:55,837 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-18 14:13:55,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:13:55,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-18 14:13:55,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 14:13:55,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2018-11-18 14:13:55,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 14:13:55,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 14:13:55,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2018-11-18 14:13:55,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:13:55,839 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 14:13:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2018-11-18 14:13:55,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 14:13:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 14:13:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-18 14:13:55,840 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 14:13:55,840 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 14:13:55,840 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 14:13:55,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-18 14:13:55,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 14:13:55,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:13:55,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:13:55,841 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:13:55,841 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 14:13:55,842 INFO L794 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 73#L555-4 [2018-11-18 14:13:55,842 INFO L796 eck$LassoCheckResult]: Loop: 73#L555-4 assume true; 79#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 76#L555-2 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 74#L557-4 assume true; 75#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 80#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 81#L557-4 assume true; 83#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 82#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 78#L557-5 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 73#L555-4 [2018-11-18 14:13:55,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:55,842 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 14:13:55,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:55,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:55,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:13:55,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:55,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:55,861 INFO L82 PathProgramCache]: Analyzing trace with hash -599763852, now seen corresponding path program 1 times [2018-11-18 14:13:55,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:55,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:55,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:13:55,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:55,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:55,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1604849078, now seen corresponding path program 1 times [2018-11-18 14:13:55,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:55,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:13:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:56,028 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2018-11-18 14:13:56,195 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-18 14:13:56,276 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:13:56,277 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:13:56,277 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:13:56,277 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:13:56,277 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:13:56,277 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:13:56,277 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:13:56,277 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:13:56,277 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-18 14:13:56,277 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:13:56,278 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:13:56,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,486 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-11-18 14:13:56,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:56,832 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:13:56,836 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:13:56,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:13:56,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:56,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:13:56,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:13:56,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:13:56,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:56,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:13:56,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:13:56,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:13:56,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:56,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:13:56,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:13:56,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:56,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:56,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:56,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:13:56,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:56,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:13:56,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:13:56,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:56,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:56,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:56,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:56,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:56,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:56,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:56,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:56,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:56,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:56,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:56,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:56,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,877 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:13:56,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,878 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:13:56,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:56,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:56,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:56,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:56,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,887 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:13:56,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,888 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:13:56,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:56,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:56,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:56,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:56,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:56,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:56,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:56,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:56,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:56,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:56,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:56,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:56,921 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:13:56,925 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:13:56,925 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 14:13:56,927 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:13:56,928 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:13:56,929 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:13:56,929 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-18 14:13:57,011 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-18 14:13:57,017 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:13:57,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:13:57,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:13:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:13:57,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:13:57,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-11-18 14:13:57,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-18 14:13:57,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:13:57,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:57,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2018-11-18 14:13:57,144 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 14:13:57,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:13:57,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:13:57,177 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:40 [2018-11-18 14:13:57,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:57,195 INFO L477 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 34 treesize of output 37 [2018-11-18 14:13:57,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:57,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-18 14:13:57,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:13:57,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:13:57,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:57,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2018-11-18 14:13:57,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:57,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:57,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:57,235 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-18 14:13:57,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 14:13:57,259 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:57,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-11-18 14:13:57,260 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 14:13:57,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:13:57,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:13:57,282 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:74, output treesize:22 [2018-11-18 14:13:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:13:57,329 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-18 14:13:57,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 8 states. [2018-11-18 14:13:57,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 8 states. Result 32 states and 35 transitions. Complement of second has 15 states. [2018-11-18 14:13:57,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-18 14:13:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 14:13:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-11-18 14:13:57,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-18 14:13:57,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:13:57,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-18 14:13:57,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:13:57,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 12 transitions. Stem has 2 letters. Loop has 20 letters. [2018-11-18 14:13:57,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:13:57,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-11-18 14:13:57,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 14:13:57,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 34 transitions. [2018-11-18 14:13:57,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 14:13:57,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 14:13:57,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 34 transitions. [2018-11-18 14:13:57,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:13:57,452 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-18 14:13:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 34 transitions. [2018-11-18 14:13:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-18 14:13:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 14:13:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-18 14:13:57,457 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-18 14:13:57,457 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-18 14:13:57,457 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 14:13:57,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2018-11-18 14:13:57,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 14:13:57,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:13:57,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:13:57,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:13:57,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 14:13:57,459 INFO L794 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 275#L555-4 assume true; 289#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 301#L555-2 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 300#L557-4 assume true; 299#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 292#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 276#L557-4 [2018-11-18 14:13:57,459 INFO L796 eck$LassoCheckResult]: Loop: 276#L557-4 assume true; 277#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 290#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 297#L557-4 assume true; 298#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 296#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 283#L557-5 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 284#L555-4 assume true; 287#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 280#L555-2 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 276#L557-4 [2018-11-18 14:13:57,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:57,459 INFO L82 PathProgramCache]: Analyzing trace with hash 147120206, now seen corresponding path program 1 times [2018-11-18 14:13:57,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:57,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:57,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:13:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:57,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash 820937198, now seen corresponding path program 2 times [2018-11-18 14:13:57,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:57,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:57,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:57,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:13:57,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:57,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:57,490 INFO L82 PathProgramCache]: Analyzing trace with hash -102423045, now seen corresponding path program 2 times [2018-11-18 14:13:57,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:57,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:57,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:13:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:57,946 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-11-18 14:13:58,037 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:13:58,038 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:13:58,038 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:13:58,038 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:13:58,038 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:13:58,038 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:13:58,038 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:13:58,038 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:13:58,038 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-18 14:13:58,038 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:13:58,038 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:13:58,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:58,535 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:13:58,535 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:13:58,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:58,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:58,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:13:58,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:58,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:58,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:58,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:13:58,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:13:58,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:58,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:58,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:58,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:58,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:58,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:58,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:58,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:58,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:58,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:58,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:58,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:13:58,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:58,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:58,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:58,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:13:58,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:13:58,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:58,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:58,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:58,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:13:58,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:58,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:58,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:58,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:13:58,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:13:58,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:58,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:58,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:58,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:13:58,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:58,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:58,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:58,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:13:58,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:13:58,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:58,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 [2018-11-18 14:13:58,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:58,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:58,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:58,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:58,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:58,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:58,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:58,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:58,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:58,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:58,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:58,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:58,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:58,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:58,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:58,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:58,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:58,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:58,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:58,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:58,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:58,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:58,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:58,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:13:58,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:58,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:58,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:58,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:58,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:58,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:58,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:13:58,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 [2018-11-18 14:13:58,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:13:58,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:13:58,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:13:58,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:13:58,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:13:58,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:13:58,583 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:13:58,598 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 14:13:58,599 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 14:13:58,599 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:13:58,600 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:13:58,600 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:13:58,600 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-18 14:13:58,652 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-18 14:13:58,653 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:13:58,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:13:58,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:13:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:13:58,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:13:58,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:58,683 INFO L477 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 25 treesize of output 28 [2018-11-18 14:13:58,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:58,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-18 14:13:58,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:13:58,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:13:58,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:13:58,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-18 14:13:58,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:58,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2018-11-18 14:13:58,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:58,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-18 14:13:58,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:13:58,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:58,778 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:13:58,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 52 [2018-11-18 14:13:58,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 14:13:58,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:13:58,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:13:58,818 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:38 [2018-11-18 14:13:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:13:58,864 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-18 14:13:58,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 31 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-18 14:13:59,061 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 31 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 94 states and 100 transitions. Complement of second has 23 states. [2018-11-18 14:13:59,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-18 14:13:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 14:13:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2018-11-18 14:13:59,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 23 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-18 14:13:59,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:13:59,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 23 transitions. Stem has 18 letters. Loop has 10 letters. [2018-11-18 14:13:59,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:13:59,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 23 transitions. Stem has 8 letters. Loop has 20 letters. [2018-11-18 14:13:59,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:13:59,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 100 transitions. [2018-11-18 14:13:59,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 14:13:59,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 66 states and 72 transitions. [2018-11-18 14:13:59,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-18 14:13:59,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-18 14:13:59,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 72 transitions. [2018-11-18 14:13:59,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:13:59,067 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-11-18 14:13:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 72 transitions. [2018-11-18 14:13:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2018-11-18 14:13:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 14:13:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-18 14:13:59,070 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-18 14:13:59,070 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-18 14:13:59,070 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 14:13:59,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 49 transitions. [2018-11-18 14:13:59,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 14:13:59,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:13:59,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:13:59,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 14:13:59,072 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 14:13:59,072 INFO L794 eck$LassoCheckResult]: Stem: 608#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 599#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 600#L555-4 assume true; 640#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 639#L555-2 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 638#L557-4 assume true; 637#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 636#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 635#L557-4 assume true; 623#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 618#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 602#L557-4 [2018-11-18 14:13:59,072 INFO L796 eck$LassoCheckResult]: Loop: 602#L557-4 assume true; 605#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 616#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 621#L557-4 assume true; 622#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 620#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 609#L557-5 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 610#L555-4 assume true; 613#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 601#L555-2 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 602#L557-4 [2018-11-18 14:13:59,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1991431976, now seen corresponding path program 2 times [2018-11-18 14:13:59,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:59,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:59,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:59,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:13:59,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:59,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:59,088 INFO L82 PathProgramCache]: Analyzing trace with hash 820937198, now seen corresponding path program 3 times [2018-11-18 14:13:59,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:59,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:59,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:59,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:13:59,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:59,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:13:59,099 INFO L82 PathProgramCache]: Analyzing trace with hash 840422485, now seen corresponding path program 3 times [2018-11-18 14:13:59,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:13:59,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:13:59,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:59,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:13:59,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:13:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:13:59,827 WARN L180 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 120 [2018-11-18 14:13:59,927 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:13:59,927 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:13:59,927 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:13:59,927 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:13:59,927 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:13:59,927 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:13:59,927 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:13:59,927 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:13:59,927 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-18 14:13:59,927 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:13:59,928 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:13:59,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:59,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:59,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:59,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:59,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:59,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:59,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:13:59,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:00,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:00,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:00,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:00,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:00,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:00,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:00,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:00,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:00,422 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:00,422 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:14:00,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:00,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:00,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:00,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:00,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:00,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:00,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:00,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:00,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:00,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:00,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:00,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:00,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:00,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:00,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:00,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:00,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:00,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:00,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:00,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:00,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:00,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:00,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:00,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:00,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:00,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:00,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:00,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:00,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:00,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:00,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,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 [2018-11-18 14:14:00,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:00,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:00,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:00,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,448 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:14:00,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,449 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:14:00,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:00,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,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 [2018-11-18 14:14:00,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:00,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:00,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:00,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:00,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:00,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:00,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:00,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:00,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:00,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:00,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:00,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:00,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:00,467 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:14:00,473 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 14:14:00,474 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 14:14:00,474 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:14:00,474 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:14:00,475 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:14:00,475 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 [] [2018-11-18 14:14:00,538 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-18 14:14:00,539 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:14:00,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:00,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:00,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:00,585 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:00,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2018-11-18 14:14:00,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:00,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-18 14:14:00,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:00,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:00,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:00,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:00,621 INFO L477 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 [2018-11-18 14:14:00,621 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:00,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:00,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:00,643 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:50 [2018-11-18 14:14:00,705 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:00,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-11-18 14:14:00,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:00,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2018-11-18 14:14:00,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:00,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:14:00,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:00,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-11-18 14:14:00,735 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 14:14:00,736 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:00,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 54 [2018-11-18 14:14:00,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:00,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:14:00,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:00,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:61 [2018-11-18 14:14:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:14:00,799 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-18 14:14:00,799 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 49 transitions. cyclomatic complexity: 8 Second operand 9 states. [2018-11-18 14:14:00,926 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 49 transitions. cyclomatic complexity: 8. Second operand 9 states. Result 104 states and 115 transitions. Complement of second has 17 states. [2018-11-18 14:14:00,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-18 14:14:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 14:14:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-18 14:14:00,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-18 14:14:00,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:00,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-18 14:14:00,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:00,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 23 transitions. Stem has 11 letters. Loop has 20 letters. [2018-11-18 14:14:00,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:00,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 115 transitions. [2018-11-18 14:14:00,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 14:14:00,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 83 states and 93 transitions. [2018-11-18 14:14:00,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-18 14:14:00,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-18 14:14:00,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 93 transitions. [2018-11-18 14:14:00,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:00,932 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-11-18 14:14:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 93 transitions. [2018-11-18 14:14:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 60. [2018-11-18 14:14:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 14:14:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-11-18 14:14:00,935 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-18 14:14:00,935 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-18 14:14:00,935 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 14:14:00,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 69 transitions. [2018-11-18 14:14:00,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 14:14:00,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:14:00,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:14:00,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:14:00,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:14:00,936 INFO L794 eck$LassoCheckResult]: Stem: 957#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 947#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 948#L555-4 assume true; 962#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 953#L555-2 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 954#L557-4 assume true; 1002#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1000#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 997#L557-4 assume true; 950#L557-1 [2018-11-18 14:14:00,936 INFO L796 eck$LassoCheckResult]: Loop: 950#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 966#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 949#L557-4 assume true; 950#L557-1 [2018-11-18 14:14:00,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:00,936 INFO L82 PathProgramCache]: Analyzing trace with hash 265759107, now seen corresponding path program 3 times [2018-11-18 14:14:00,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:00,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:00,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:00,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:00,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:00,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:00,950 INFO L82 PathProgramCache]: Analyzing trace with hash 48811, now seen corresponding path program 1 times [2018-11-18 14:14:00,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:00,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:00,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:00,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:00,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:00,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:00,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1604849129, now seen corresponding path program 4 times [2018-11-18 14:14:00,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:00,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:00,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:00,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:14:00,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:01,265 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 101 [2018-11-18 14:14:01,332 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:01,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:01,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:01,333 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:01,333 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:14:01,333 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:01,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:01,333 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:01,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration6_Lasso [2018-11-18 14:14:01,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:01,333 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:01,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:01,797 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:01,797 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:14:01,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:01,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:01,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:01,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:01,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:01,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:01,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:01,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:01,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:01,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:01,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:01,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:01,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:01,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:01,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:01,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:01,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:01,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:01,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:01,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:01,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:01,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:01,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,828 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:14:01,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,829 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:14:01,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:01,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:01,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:01,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:01,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:01,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:01,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:01,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:01,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:01,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:01,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:01,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:01,848 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:14:01,852 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 14:14:01,852 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 14:14:01,852 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:14:01,853 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:14:01,853 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:14:01,853 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, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_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 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 Supporting invariants [] [2018-11-18 14:14:01,919 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-18 14:14:01,922 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:14:01,922 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:14:01,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:01,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:01,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:01,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:01,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-11-18 14:14:01,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:01,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-18 14:14:01,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:02,016 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:02,016 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:02,018 INFO L477 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 34 treesize of output 49 [2018-11-18 14:14:02,018 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:02,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:02,037 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-18 14:14:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:14:02,052 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 14:14:02,052 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-18 14:14:02,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 69 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 128 states and 140 transitions. Complement of second has 7 states. [2018-11-18 14:14:02,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 14:14:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:14:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-18 14:14:02,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-18 14:14:02,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:02,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 14:14:02,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:02,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-18 14:14:02,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:02,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 140 transitions. [2018-11-18 14:14:02,072 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 14:14:02,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 97 states and 107 transitions. [2018-11-18 14:14:02,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-18 14:14:02,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-18 14:14:02,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 107 transitions. [2018-11-18 14:14:02,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:02,074 INFO L705 BuchiCegarLoop]: Abstraction has 97 states and 107 transitions. [2018-11-18 14:14:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 107 transitions. [2018-11-18 14:14:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 68. [2018-11-18 14:14:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 14:14:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-11-18 14:14:02,078 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-11-18 14:14:02,078 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-11-18 14:14:02,078 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 14:14:02,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 77 transitions. [2018-11-18 14:14:02,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 14:14:02,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:14:02,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:14:02,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 14:14:02,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 14:14:02,080 INFO L794 eck$LassoCheckResult]: Stem: 1285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1276#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1277#L555-4 assume true; 1291#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1280#L555-2 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1281#L557-4 assume true; 1325#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1324#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1323#L557-4 assume true; 1322#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1321#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 1318#L557-5 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 1317#L555-4 assume true; 1301#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1278#L555-2 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1279#L557-4 assume true; 1282#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1310#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1309#L557-4 [2018-11-18 14:14:02,081 INFO L796 eck$LassoCheckResult]: Loop: 1309#L557-4 assume true; 1308#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1307#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1305#L557-4 assume true; 1306#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1304#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 1286#L557-5 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 1287#L555-4 assume true; 1312#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1311#L555-2 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1309#L557-4 [2018-11-18 14:14:02,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:02,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1493985281, now seen corresponding path program 4 times [2018-11-18 14:14:02,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:02,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:02,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:02,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:02,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:14:02,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:14:02,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_061424fc-f4ed-49f2-9ea9-b919422f53e8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:14:02,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 14:14:02,194 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 14:14:02,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:14:02,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:02,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-11-18 14:14:02,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 14:14:02,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-18 14:14:02,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:02,233 INFO L477 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 25 treesize of output 28 [2018-11-18 14:14:02,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:02,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-18 14:14:02,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 14:14:02,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:02,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 52 [2018-11-18 14:14:02,337 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:02,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-11-18 14:14:02,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,375 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:02,376 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:02,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 47 [2018-11-18 14:14:02,386 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 14:14:02,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:02,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 14:14:02,408 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:29 [2018-11-18 14:14:02,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-18 14:14:02,435 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-11-18 14:14:02,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,445 INFO L477 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 15 treesize of output 11 [2018-11-18 14:14:02,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:02,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:02,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-11-18 14:14:02,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:02,473 INFO L477 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 [2018-11-18 14:14:02,475 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 14:14:02,475 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,477 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:14:02,480 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:44, output treesize:3 [2018-11-18 14:14:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:14:02,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:14:02,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-18 14:14:02,498 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:14:02,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:02,498 INFO L82 PathProgramCache]: Analyzing trace with hash 820937198, now seen corresponding path program 4 times [2018-11-18 14:14:02,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:02,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:02,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:02,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:02,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 14:14:02,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:14:02,576 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. cyclomatic complexity: 15 Second operand 12 states. [2018-11-18 14:14:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:14:02,696 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-11-18 14:14:02,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 14:14:02,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 85 transitions. [2018-11-18 14:14:02,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:14:02,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 53 states and 58 transitions. [2018-11-18 14:14:02,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 14:14:02,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 14:14:02,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 58 transitions. [2018-11-18 14:14:02,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:02,698 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-18 14:14:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 58 transitions. [2018-11-18 14:14:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2018-11-18 14:14:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 14:14:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-18 14:14:02,701 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-18 14:14:02,701 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-18 14:14:02,701 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 14:14:02,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2018-11-18 14:14:02,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:14:02,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:14:02,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:14:02,702 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 14:14:02,702 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:14:02,702 INFO L794 eck$LassoCheckResult]: Stem: 1511#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1501#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1502#L555-4 assume true; 1514#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1503#L555-2 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1504#L557-4 assume true; 1516#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1517#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1535#L557-4 assume true; 1534#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1533#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1524#L557-4 assume true; 1523#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1522#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 1512#L557-5 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 1513#L555-4 assume true; 1515#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1505#L555-2 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1506#L557-4 assume true; 1508#L557-1 [2018-11-18 14:14:02,702 INFO L796 eck$LassoCheckResult]: Loop: 1508#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1520#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1507#L557-4 assume true; 1508#L557-1 [2018-11-18 14:14:02,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:02,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1119852918, now seen corresponding path program 5 times [2018-11-18 14:14:02,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:02,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:02,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:02,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:02,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:02,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:02,720 INFO L82 PathProgramCache]: Analyzing trace with hash 48811, now seen corresponding path program 2 times [2018-11-18 14:14:02,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:02,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:02,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:02,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:02,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:02,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1767656170, now seen corresponding path program 6 times [2018-11-18 14:14:02,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:02,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:02,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:02,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:02,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:04,131 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 160 DAG size of output: 148 [2018-11-18 14:14:04,315 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-11-18 14:14:04,317 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:04,317 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:04,317 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:04,317 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:04,317 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:14:04,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:04,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:04,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:04,317 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-11-18 14:14:04,317 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:04,317 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:04,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:14:04,801 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:04,801 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:14:04,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:04,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:04,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:04,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:04,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:04,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:04,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:04,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:04,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:04,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:04,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:04,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:04,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:04,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:04,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:04,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:04,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:04,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:04,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:04,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:04,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:04,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,823 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:14:04,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,824 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:14:04,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,832 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:14:04,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,832 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:14:04,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,835 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:14:04,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,835 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:14:04,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:04,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:14:04,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:04,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:04,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:04,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:04,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:04,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:04,893 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:14:04,896 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:14:04,896 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 14:14:04,896 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:14:04,897 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:14:04,897 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:14:04,897 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)_5, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_5) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_5 Supporting invariants [] [2018-11-18 14:14:04,992 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-18 14:14:04,994 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:14:04,994 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:14:05,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:05,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:05,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:05,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-11-18 14:14:05,046 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,047 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,047 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,048 INFO L477 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 44 treesize of output 49 [2018-11-18 14:14:05,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:05,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-18 14:14:05,069 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:05,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:05,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:05,089 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-18 14:14:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:14:05,103 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 14:14:05,103 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 14:14:05,117 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 53 states and 59 transitions. Complement of second has 7 states. [2018-11-18 14:14:05,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 14:14:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:14:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-18 14:14:05,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-18 14:14:05,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:05,118 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:14:05,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:05,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:05,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:05,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-11-18 14:14:05,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,164 INFO L477 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 44 treesize of output 49 [2018-11-18 14:14:05,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:05,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-18 14:14:05,185 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:05,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:05,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:05,205 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-18 14:14:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:14:05,219 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 14:14:05,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 14:14:05,244 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 53 states and 57 transitions. Complement of second has 9 states. [2018-11-18 14:14:05,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 14:14:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:14:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-18 14:14:05,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-18 14:14:05,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:05,245 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:14:05,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:05,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:05,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:05,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-11-18 14:14:05,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-18 14:14:05,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:05,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:14:05,317 INFO L477 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 34 treesize of output 49 [2018-11-18 14:14:05,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 14:14:05,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:05,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:14:05,337 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-18 14:14:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:14:05,352 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 14:14:05,352 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 14:14:05,364 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 62 states and 68 transitions. Complement of second has 8 states. [2018-11-18 14:14:05,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 14:14:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:14:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 14:14:05,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-18 14:14:05,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:05,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-18 14:14:05,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:05,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-18 14:14:05,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:05,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 68 transitions. [2018-11-18 14:14:05,366 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:14:05,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 0 states and 0 transitions. [2018-11-18 14:14:05,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 14:14:05,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 14:14:05,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 14:14:05,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:14:05,367 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:14:05,367 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:14:05,367 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:14:05,367 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 14:14:05,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:14:05,367 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:14:05,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 14:14:05,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 02:14:05 BoogieIcfgContainer [2018-11-18 14:14:05,371 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 14:14:05,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:14:05,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:14:05,371 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:14:05,371 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:13:55" (3/4) ... [2018-11-18 14:14:05,373 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 14:14:05,373 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:14:05,374 INFO L168 Benchmark]: Toolchain (without parser) took 10745.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 98.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:14:05,374 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:14:05,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:14:05,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.82 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:14:05,375 INFO L168 Benchmark]: Boogie Preprocessor took 16.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:14:05,375 INFO L168 Benchmark]: RCFGBuilder took 225.57 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:14:05,375 INFO L168 Benchmark]: BuchiAutomizer took 10139.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -48.9 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:14:05,376 INFO L168 Benchmark]: Witness Printer took 2.52 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:14:05,379 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.82 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.57 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10139.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -48.9 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.52 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 12 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 9 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.1s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 7.9s. Construction of modules took 0.2s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 94 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 68 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/9 HoareTripleCheckerStatistics: 91 SDtfs, 94 SDslu, 108 SDs, 0 SdLazy, 294 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital597 mio100 ax103 hnf100 lsp94 ukn35 mio100 lsp36 div100 bol100 ite100 ukn100 eq183 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...