./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/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 abee338f12eaa8176313da7ed567414f687b7fa7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:34:34,406 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:34:34,407 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:34:34,414 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:34:34,414 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:34:34,414 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:34:34,415 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:34:34,416 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:34:34,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:34:34,418 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:34:34,419 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:34:34,419 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:34:34,419 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:34:34,420 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:34:34,421 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:34:34,422 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:34:34,422 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:34:34,423 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:34:34,425 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:34:34,426 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:34:34,427 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:34:34,427 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:34:34,429 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:34:34,429 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:34:34,429 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:34:34,430 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:34:34,431 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:34:34,431 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:34:34,432 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:34:34,432 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:34:34,433 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:34:34,433 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:34:34,433 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:34:34,433 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:34:34,434 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:34:34,435 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:34:34,435 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 14:34:34,446 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:34:34,446 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:34:34,447 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:34:34,447 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:34:34,447 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:34:34,447 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 14:34:34,447 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 14:34:34,448 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 14:34:34,448 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 14:34:34,448 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 14:34:34,448 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 14:34:34,448 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:34:34,448 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 14:34:34,448 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:34:34,449 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:34:34,449 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 14:34:34,449 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 14:34:34,449 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 14:34:34,449 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:34:34,449 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 14:34:34,449 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:34:34,449 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 14:34:34,450 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:34:34,450 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:34:34,450 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 14:34:34,450 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:34:34,450 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:34:34,450 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 14:34:34,451 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 14:34:34,451 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_08887202-4c90-49fb-9a2f-38ba7cdc4a64/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 -> abee338f12eaa8176313da7ed567414f687b7fa7 [2018-11-18 14:34:34,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:34:34,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:34:34,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:34:34,482 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:34:34,482 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:34:34,483 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i [2018-11-18 14:34:34,519 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/bin-2019/uautomizer/data/660f82a6a/b284d827a5ab48acb83c6e5c1ad1903f/FLAGc45d26c08 [2018-11-18 14:34:34,891 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:34:34,891 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i [2018-11-18 14:34:34,899 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/bin-2019/uautomizer/data/660f82a6a/b284d827a5ab48acb83c6e5c1ad1903f/FLAGc45d26c08 [2018-11-18 14:34:35,278 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/bin-2019/uautomizer/data/660f82a6a/b284d827a5ab48acb83c6e5c1ad1903f [2018-11-18 14:34:35,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:34:35,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:34:35,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:34:35,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:34:35,284 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:34:35,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:34:35" (1/1) ... [2018-11-18 14:34:35,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591e95ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:34:35, skipping insertion in model container [2018-11-18 14:34:35,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:34:35" (1/1) ... [2018-11-18 14:34:35,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:34:35,317 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:34:35,503 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:34:35,511 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:34:35,537 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:34:35,609 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:34:35,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:34:35 WrapperNode [2018-11-18 14:34:35,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:34:35,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:34:35,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:34:35,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:34:35,614 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:34:35" (1/1) ... [2018-11-18 14:34:35,624 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:34:35" (1/1) ... [2018-11-18 14:34:35,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:34:35,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:34:35,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:34:35,638 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:34:35,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:34:35" (1/1) ... [2018-11-18 14:34:35,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:34:35" (1/1) ... [2018-11-18 14:34:35,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:34:35" (1/1) ... [2018-11-18 14:34:35,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:34:35" (1/1) ... [2018-11-18 14:34:35,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:34:35" (1/1) ... [2018-11-18 14:34:35,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:34:35" (1/1) ... [2018-11-18 14:34:35,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:34:35" (1/1) ... [2018-11-18 14:34:35,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:34:35,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:34:35,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:34:35,656 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:34:35,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:34:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/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:34:35,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 14:34:35,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 14:34:35,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 14:34:35,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 14:34:35,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:34:35,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:34:35,853 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:34:35,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:34:35 BoogieIcfgContainer [2018-11-18 14:34:35,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:34:35,854 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 14:34:35,854 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 14:34:35,856 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 14:34:35,857 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:34:35,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 02:34:35" (1/3) ... [2018-11-18 14:34:35,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bc9b8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:34:35, skipping insertion in model container [2018-11-18 14:34:35,858 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:34:35,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:34:35" (2/3) ... [2018-11-18 14:34:35,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bc9b8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:34:35, skipping insertion in model container [2018-11-18 14:34:35,858 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:34:35,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:34:35" (3/3) ... [2018-11-18 14:34:35,859 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.18-alloca_true-termination_true-no-overflow.c.i [2018-11-18 14:34:35,889 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:34:35,889 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 14:34:35,889 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 14:34:35,889 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 14:34:35,889 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:34:35,889 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:34:35,889 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 14:34:35,890 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:34:35,890 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 14:34:35,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 14:34:35,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-18 14:34:35,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:34:35,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:34:35,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:34:35,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 14:34:35,918 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 14:34:35,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 14:34:35,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-18 14:34:35,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:34:35,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:34:35,919 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:34:35,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 14:34:35,924 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.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 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); 9#L559-5true [2018-11-18 14:34:35,924 INFO L796 eck$LassoCheckResult]: Loop: 9#L559-5true assume true; 16#L553-1true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 18#L553-2true assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 22#L553-4true assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 10#L554true assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 19#L555-4true assume !true; 9#L559-5true [2018-11-18 14:34:35,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:35,929 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 14:34:35,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:35,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:35,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:35,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:35,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:36,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1067013432, now seen corresponding path program 1 times [2018-11-18 14:34:36,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:36,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:36,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:36,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:36,043 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:34:36,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:34:36,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-18 14:34:36,047 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:34:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 14:34:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 14:34:36,058 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-18 14:34:36,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:34:36,063 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-11-18 14:34:36,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 14:34:36,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-11-18 14:34:36,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-18 14:34:36,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 13 states and 17 transitions. [2018-11-18 14:34:36,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 14:34:36,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 14:34:36,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-18 14:34:36,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:34:36,072 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-18 14:34:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-18 14:34:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 14:34:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 14:34:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-18 14:34:36,092 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-18 14:34:36,092 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-18 14:34:36,092 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 14:34:36,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-18 14:34:36,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-18 14:34:36,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:34:36,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:34:36,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:34:36,094 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:34:36,094 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 57#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.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 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); 51#L559-5 [2018-11-18 14:34:36,094 INFO L796 eck$LassoCheckResult]: Loop: 51#L559-5 assume true; 56#L553-1 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 59#L553-2 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 60#L553-4 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 52#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 50#L559-4 assume true; 48#L559-1 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 49#L559-2 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 51#L559-5 [2018-11-18 14:34:36,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:36,094 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 14:34:36,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:36,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:36,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:36,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:36,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1096790798, now seen corresponding path program 1 times [2018-11-18 14:34:36,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:36,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:36,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:34:36,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:36,182 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:34:36,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:34:36,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:34:36,183 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:34:36,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:34:36,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:34:36,184 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-18 14:34:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:34:36,244 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-11-18 14:34:36,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:34:36,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2018-11-18 14:34:36,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-18 14:34:36,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 29 transitions. [2018-11-18 14:34:36,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-18 14:34:36,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-18 14:34:36,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-11-18 14:34:36,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:34:36,247 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-18 14:34:36,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-11-18 14:34:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-11-18 14:34:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 14:34:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-18 14:34:36,248 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-18 14:34:36,249 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-18 14:34:36,249 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 14:34:36,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-18 14:34:36,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 14:34:36,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:34:36,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:34:36,250 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:34:36,250 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:34:36,250 INFO L794 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.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 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); 98#L559-5 [2018-11-18 14:34:36,250 INFO L796 eck$LassoCheckResult]: Loop: 98#L559-5 assume true; 99#L553-1 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 107#L553-2 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 108#L553-4 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 100#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 101#L555-4 assume true; 103#L555-1 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 104#L555-2 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 98#L559-5 [2018-11-18 14:34:36,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:36,250 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 14:34:36,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:36,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1097283342, now seen corresponding path program 1 times [2018-11-18 14:34:36,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:36,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:34:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:36,309 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:34:36,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:34:36,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:34:36,310 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:34:36,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:34:36,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:34:36,310 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-18 14:34:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:34:36,350 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-18 14:34:36,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:34:36,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-18 14:34:36,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-18 14:34:36,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2018-11-18 14:34:36,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 14:34:36,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 14:34:36,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-11-18 14:34:36,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:34:36,352 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-18 14:34:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-11-18 14:34:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-18 14:34:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 14:34:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-18 14:34:36,353 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 14:34:36,353 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 14:34:36,353 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 14:34:36,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-18 14:34:36,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-18 14:34:36,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:34:36,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:34:36,354 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:34:36,354 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:34:36,354 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.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 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); 146#L559-5 [2018-11-18 14:34:36,354 INFO L796 eck$LassoCheckResult]: Loop: 146#L559-5 assume true; 147#L553-1 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 153#L553-2 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 154#L553-4 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 148#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 149#L555-4 assume true; 144#L555-1 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 145#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 151#L555-4 assume true; 158#L555-1 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 155#L555-2 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 146#L559-5 [2018-11-18 14:34:36,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:36,354 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 14:34:36,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:36,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:36,367 INFO L82 PathProgramCache]: Analyzing trace with hash -171866199, now seen corresponding path program 1 times [2018-11-18 14:34:36,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:36,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:36,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:34:36,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:36,424 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:34:36,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:34:36,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_08887202-4c90-49fb-9a2f-38ba7cdc4a64/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:34:36,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:36,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:34:36,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:34:36,553 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:34:36,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:34:36,560 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:34:36,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:34:36,593 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:34:36,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:34:36,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:34:36,599 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:34:36,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 14:34:36,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:34:36,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 14:34:36,655 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 [2018-11-18 14:34:36,687 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 30 treesize of output 22 [2018-11-18 14:34:36,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-18 14:34:36,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:34:36,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:34:36,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-18 14:34:36,723 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 13 treesize of output 9 [2018-11-18 14:34:36,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 14:34:36,736 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 11 treesize of output 7 [2018-11-18 14:34:36,737 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 14:34:36,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:34:36,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:34:36,774 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:61, output treesize:3 [2018-11-18 14:34:36,777 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:34:36,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:34:36,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-18 14:34:36,803 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:34:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:34:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:34:36,804 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-18 14:34:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:34:36,945 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-18 14:34:36,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 14:34:36,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-11-18 14:34:36,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-18 14:34:36,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2018-11-18 14:34:36,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 14:34:36,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 14:34:36,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-18 14:34:36,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:34:36,947 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-18 14:34:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-18 14:34:36,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 14:34:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 14:34:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-18 14:34:36,949 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-18 14:34:36,949 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-18 14:34:36,949 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 14:34:36,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-11-18 14:34:36,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-18 14:34:36,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:34:36,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:34:36,950 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:34:36,950 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:34:36,950 INFO L794 eck$LassoCheckResult]: Stem: 246#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 244#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.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 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); 240#L559-5 [2018-11-18 14:34:36,950 INFO L796 eck$LassoCheckResult]: Loop: 240#L559-5 assume true; 241#L553-1 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 247#L553-2 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 248#L553-4 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 242#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 237#L559-4 assume true; 234#L559-1 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 235#L559-2 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 236#L559-4 assume true; 253#L559-1 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 249#L559-2 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 240#L559-5 [2018-11-18 14:34:36,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:36,951 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 14:34:36,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:36,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:36,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:36,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:36,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1616626105, now seen corresponding path program 1 times [2018-11-18 14:34:36,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:36,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:36,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:34:36,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:36,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1240150199, now seen corresponding path program 1 times [2018-11-18 14:34:36,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:36,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:36,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:36,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:37,212 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2018-11-18 14:34:37,258 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:34:37,259 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:34:37,259 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:34:37,259 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:34:37,259 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:34:37,259 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:34:37,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:34:37,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:34:37,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-18 14:34:37,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:34:37,259 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:34:37,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:34:37,274 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:34:37,275 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:34:37,276 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:34:37,278 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:34:37,280 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:34:37,281 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:34:37,282 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:34:37,284 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:34:37,408 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:34:37,409 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:34:37,410 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:34:37,411 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:34:37,412 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:34:37,414 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:34:37,415 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:34:37,416 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:34:37,417 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:34:37,418 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:34:37,419 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:34:37,421 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:34:37,422 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:34:37,423 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:34:37,424 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:34:37,641 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:34:37,644 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:34:37,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:37,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:37,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:37,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:37,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:37,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:37,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:37,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:37,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:37,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:37,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:37,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:37,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:37,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:37,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:37,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:37,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:37,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:37,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:37,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:37,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:37,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:37,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:37,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:37,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:37,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:37,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:37,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:37,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:37,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:37,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:37,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:37,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:37,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:37,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:37,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:37,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:37,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:37,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,678 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:34:37,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,680 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:34:37,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:37,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:37,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:37,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:37,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:37,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:37,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,701 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:34:37,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,703 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:34:37,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:37,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:37,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:37,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:37,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:37,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:37,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:37,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:37,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:37,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:37,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:37,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:37,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:37,733 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:34:37,747 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 14:34:37,747 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 14:34:37,748 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:34:37,750 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:34:37,750 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:34:37,750 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-18 14:34:37,782 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 14:34:37,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:34:37,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:37,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:34:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:37,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:34:37,817 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 10 treesize of output 8 [2018-11-18 14:34:37,819 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 5 treesize of output 3 [2018-11-18 14:34:37,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:34:37,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:34:37,826 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:34:37,828 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 11 treesize of output 7 [2018-11-18 14:34:37,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 14:34:37,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:34:37,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:34:37,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:6 [2018-11-18 14:34:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 14:34:37,857 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 14:34:37,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-18 14:34:37,961 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 54 states and 65 transitions. Complement of second has 10 states. [2018-11-18 14:34:37,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 14:34:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 14:34:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-18 14:34:37,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 2 letters. Loop has 11 letters. [2018-11-18 14:34:37,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:34:37,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 13 letters. Loop has 11 letters. [2018-11-18 14:34:37,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:34:37,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 2 letters. Loop has 22 letters. [2018-11-18 14:34:37,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:34:37,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2018-11-18 14:34:37,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 14:34:37,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 51 states and 62 transitions. [2018-11-18 14:34:37,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 14:34:37,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-18 14:34:37,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 62 transitions. [2018-11-18 14:34:37,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:34:37,967 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2018-11-18 14:34:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 62 transitions. [2018-11-18 14:34:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-11-18 14:34:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 14:34:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-18 14:34:37,969 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-18 14:34:37,969 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-18 14:34:37,969 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 14:34:37,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 50 transitions. [2018-11-18 14:34:37,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 14:34:37,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:34:37,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:34:37,971 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 14:34:37,971 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 14:34:37,971 INFO L794 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 448#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.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 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); 449#L559-5 assume true; 440#L553-1 [2018-11-18 14:34:37,971 INFO L796 eck$LassoCheckResult]: Loop: 440#L553-1 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 453#L553-2 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 456#L553-4 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 443#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 444#L555-4 assume true; 436#L555-1 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 437#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 450#L555-4 assume true; 455#L555-1 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 467#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 465#L555-4 assume true; 466#L555-1 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 464#L555-2 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 432#L559-5 assume true; 440#L553-1 [2018-11-18 14:34:37,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:37,972 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 14:34:37,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:37,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:37,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:37,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:37,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:37,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:37,981 INFO L82 PathProgramCache]: Analyzing trace with hash 37816208, now seen corresponding path program 2 times [2018-11-18 14:34:37,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:37,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:37,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:37,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:37,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:37,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1262467250, now seen corresponding path program 1 times [2018-11-18 14:34:37,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:37,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:37,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:37,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:34:37,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:38,127 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2018-11-18 14:34:38,257 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:34:38,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:34:38,258 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:34:38,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:34:38,258 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:34:38,258 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:34:38,258 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:34:38,258 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:34:38,258 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration6_Lasso [2018-11-18 14:34:38,258 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:34:38,258 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:34:38,260 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:34:38,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:34:38,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:34:38,264 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:34:38,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:34:38,267 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:34:38,269 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:34:38,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:34:38,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:34:38,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:34:38,275 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:34:38,276 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:34:38,277 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:34:38,278 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:34:38,279 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:34:38,281 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:34:38,282 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:34:38,283 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:34:38,402 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:34:38,405 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:34:38,406 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:34:38,407 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:34:38,408 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:34:38,409 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:34:38,592 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:34:38,592 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:34:38,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:34:38,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:38,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:38,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:38,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:38,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:38,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:38,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:34:38,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:38,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:38,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:38,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:38,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:38,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:38,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:38,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:38,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:38,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:38,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:38,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:38,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:38,645 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:34:38,654 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 14:34:38,654 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 14:34:38,655 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:34:38,655 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:34:38,656 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:34:38,656 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-11-18 14:34:38,687 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 14:34:38,688 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:34:38,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:38,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:34:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:38,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:34:38,735 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 29 treesize of output 29 [2018-11-18 14:34:38,738 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 25 treesize of output 21 [2018-11-18 14:34:38,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:34:38,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 21 [2018-11-18 14:34:38,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 14:34:38,776 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 18 treesize of output 14 [2018-11-18 14:34:38,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 14:34:38,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 14:34:38,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 14:34:38,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:21 [2018-11-18 14:34:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 14:34:38,850 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:34:38,850 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 50 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-18 14:34:38,927 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 50 transitions. cyclomatic complexity: 12. Second operand 8 states. Result 81 states and 101 transitions. Complement of second has 12 states. [2018-11-18 14:34:38,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 14:34:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 14:34:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2018-11-18 14:34:38,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 3 letters. Loop has 14 letters. [2018-11-18 14:34:38,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:34:38,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 17 letters. Loop has 14 letters. [2018-11-18 14:34:38,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:34:38,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 3 letters. Loop has 28 letters. [2018-11-18 14:34:38,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:34:38,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 101 transitions. [2018-11-18 14:34:38,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 14:34:38,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 69 states and 85 transitions. [2018-11-18 14:34:38,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 14:34:38,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 14:34:38,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. [2018-11-18 14:34:38,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:34:38,932 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-11-18 14:34:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. [2018-11-18 14:34:38,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-18 14:34:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 14:34:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2018-11-18 14:34:38,936 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-11-18 14:34:38,936 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-11-18 14:34:38,936 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 14:34:38,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2018-11-18 14:34:38,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 14:34:38,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:34:38,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:34:38,938 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:34:38,938 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:34:38,938 INFO L794 eck$LassoCheckResult]: Stem: 704#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 701#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.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 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); 695#L559-5 assume true; 696#L553-1 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 705#L553-2 assume !test_fun_#t~short6; 709#L553-4 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 699#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 700#L555-4 assume true; 706#L555-1 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 748#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 746#L555-4 assume true; 691#L555-1 [2018-11-18 14:34:38,938 INFO L796 eck$LassoCheckResult]: Loop: 691#L555-1 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 692#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 702#L555-4 assume true; 691#L555-1 [2018-11-18 14:34:38,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:38,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2051531430, now seen corresponding path program 1 times [2018-11-18 14:34:38,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:38,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:38,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:38,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:38,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 14:34:38,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:34:38,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:34:38,952 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:34:38,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:38,953 INFO L82 PathProgramCache]: Analyzing trace with hash 57748, now seen corresponding path program 1 times [2018-11-18 14:34:38,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:38,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:38,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:38,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:38,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:34:39,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:34:39,003 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. cyclomatic complexity: 23 Second operand 3 states. [2018-11-18 14:34:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:34:39,011 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-11-18 14:34:39,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:34:39,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 83 transitions. [2018-11-18 14:34:39,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 14:34:39,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 67 states and 80 transitions. [2018-11-18 14:34:39,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 14:34:39,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 14:34:39,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 80 transitions. [2018-11-18 14:34:39,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:34:39,015 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-11-18 14:34:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 80 transitions. [2018-11-18 14:34:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-18 14:34:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 14:34:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2018-11-18 14:34:39,019 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-11-18 14:34:39,019 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-11-18 14:34:39,019 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 14:34:39,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. [2018-11-18 14:34:39,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 14:34:39,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:34:39,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:34:39,020 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:34:39,020 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:34:39,020 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 846#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.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 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); 842#L559-5 assume true; 843#L553-1 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 850#L553-2 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 863#L553-4 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 861#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 859#L555-4 assume true; 857#L555-1 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 856#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 854#L555-4 assume true; 838#L555-1 [2018-11-18 14:34:39,020 INFO L796 eck$LassoCheckResult]: Loop: 838#L555-1 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 839#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 847#L555-4 assume true; 838#L555-1 [2018-11-18 14:34:39,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:39,025 INFO L82 PathProgramCache]: Analyzing trace with hash 276524068, now seen corresponding path program 1 times [2018-11-18 14:34:39,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:39,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:39,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:39,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:39,041 INFO L82 PathProgramCache]: Analyzing trace with hash 57748, now seen corresponding path program 2 times [2018-11-18 14:34:39,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:39,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:39,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:39,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:39,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:39,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:39,049 INFO L82 PathProgramCache]: Analyzing trace with hash 181264017, now seen corresponding path program 2 times [2018-11-18 14:34:39,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:39,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:39,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:39,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:34:39,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:39,334 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2018-11-18 14:34:39,402 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:34:39,402 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:34:39,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:34:39,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:34:39,402 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:34:39,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:34:39,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:34:39,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:34:39,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-11-18 14:34:39,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:34:39,403 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:34:39,405 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:34:39,415 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:34:39,416 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:34:39,418 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:34:39,419 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:34:39,420 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:34:39,422 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:34:39,523 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:34:39,525 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:34:39,526 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:34:39,528 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:34:39,529 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:34:39,531 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:34:39,532 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:34:39,533 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:34:39,534 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:34:39,538 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:34:39,539 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:34:39,541 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:34:39,542 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:34:39,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:34:39,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:34:39,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:34:39,729 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:34:39,729 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:34:39,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:39,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:39,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:39,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:39,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:39,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:39,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:39,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:39,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:39,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:39,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:39,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:39,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:39,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:39,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:39,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:39,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:39,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:39,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:39,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:39,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:39,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:39,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:39,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:39,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:39,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:39,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:39,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:39,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:39,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:39,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:39,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:39,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:39,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:39,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:39,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:39,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:39,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:39,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:39,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:39,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:39,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:39,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:39,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:39,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:39,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:39,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:39,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:39,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:39,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:39,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:39,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:39,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:39,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:39,741 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:34:39,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:39,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:39,742 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:34:39,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:39,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:39,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:39,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:39,746 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:34:39,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:39,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:39,746 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:34:39,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:39,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:39,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:39,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:39,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:39,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:39,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:39,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:39,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:39,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:39,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:39,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:39,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:39,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:39,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:39,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:39,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:39,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:39,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:39,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:39,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:39,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:39,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:39,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:39,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:39,767 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:34:39,771 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:34:39,771 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 14:34:39,772 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:34:39,772 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:34:39,773 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:34:39,773 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:34:39,805 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2018-11-18 14:34:39,805 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:34:39,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:39,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:34:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:39,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:34:39,831 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:34:39,831 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 32 treesize of output 33 [2018-11-18 14:34:39,833 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:34:39,834 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 33 treesize of output 22 [2018-11-18 14:34:39,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:34:39,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:34:39,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:34:39,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-18 14:34:39,846 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:34:39,846 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:34:39,846 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-18 14:34:39,867 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 182 states and 216 transitions. Complement of second has 6 states. [2018-11-18 14:34:39,869 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:34:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:34:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-18 14:34:39,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 14:34:39,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:34:39,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-18 14:34:39,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:34:39,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-18 14:34:39,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:34:39,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 216 transitions. [2018-11-18 14:34:39,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 14:34:39,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 76 states and 88 transitions. [2018-11-18 14:34:39,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 14:34:39,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 14:34:39,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 88 transitions. [2018-11-18 14:34:39,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:34:39,873 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 88 transitions. [2018-11-18 14:34:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 88 transitions. [2018-11-18 14:34:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 44. [2018-11-18 14:34:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 14:34:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-18 14:34:39,876 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-18 14:34:39,876 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-18 14:34:39,876 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 14:34:39,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2018-11-18 14:34:39,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:34:39,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:34:39,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:34:39,877 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:34:39,877 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:34:39,877 INFO L794 eck$LassoCheckResult]: Stem: 1199#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.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 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); 1190#L559-5 assume true; 1191#L553-1 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1203#L553-2 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1204#L553-4 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1211#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 1210#L559-4 assume true; 1209#L559-1 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1208#L559-2 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1206#L559-4 assume true; 1181#L559-1 [2018-11-18 14:34:39,877 INFO L796 eck$LassoCheckResult]: Loop: 1181#L559-1 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1182#L559-2 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1185#L559-4 assume true; 1181#L559-1 [2018-11-18 14:34:39,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:39,877 INFO L82 PathProgramCache]: Analyzing trace with hash 291792948, now seen corresponding path program 1 times [2018-11-18 14:34:39,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:39,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:39,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:34:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:39,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash 73636, now seen corresponding path program 1 times [2018-11-18 14:34:39,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:39,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:39,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:39,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:39,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:39,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:39,897 INFO L82 PathProgramCache]: Analyzing trace with hash -210049391, now seen corresponding path program 2 times [2018-11-18 14:34:39,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:34:39,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:34:39,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:39,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:34:39,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:34:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:34:40,128 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2018-11-18 14:34:40,178 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:34:40,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:34:40,178 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:34:40,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:34:40,178 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:34:40,178 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:34:40,178 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:34:40,179 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:34:40,179 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration9_Lasso [2018-11-18 14:34:40,179 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:34:40,179 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:34:40,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:34:40,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:34:40,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:34:40,183 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:34:40,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:34:40,185 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:34:40,186 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:34:40,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:34:40,188 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:34:40,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:34:40,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:34:40,301 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:34:40,302 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:34:40,302 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:34:40,303 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:34:40,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:34:40,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:34:40,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:34:40,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:34:40,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:34:40,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:34:40,312 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:34:40,314 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:34:40,485 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:34:40,485 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:34:40,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:40,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:40,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:40,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:40,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:40,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:40,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:40,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:40,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:40,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:40,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:40,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:40,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:40,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:40,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:40,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:34:40,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:40,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:40,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:40,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:40,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:40,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:40,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:40,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:40,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:40,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:40,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:40,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:40,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:40,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:40,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:40,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:34:40,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:40,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:40,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:40,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:34:40,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:34:40,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:34:40,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:40,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:40,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:40,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:34:40,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,514 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:34:40,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,515 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:34:40,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:40,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:40,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:40,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:40,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:34:40,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:34:40,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:34:40,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:34:40,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:34:40,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:34:40,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:34:40,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:34:40,532 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:34:40,538 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 14:34:40,538 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 14:34:40,539 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:34:40,539 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:34:40,540 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:34:40,540 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 Supporting invariants [] [2018-11-18 14:34:40,583 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2018-11-18 14:34:40,584 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 14:34:40,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:34:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:40,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:34:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:34:40,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:34:40,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:34:40,622 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 32 treesize of output 33 [2018-11-18 14:34:40,624 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 14:34:40,625 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 33 treesize of output 22 [2018-11-18 14:34:40,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:34:40,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:34:40,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:34:40,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-18 14:34:40,641 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:34:40,641 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:34:40,641 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 52 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 14:34:40,668 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 52 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 110 states and 130 transitions. Complement of second has 6 states. [2018-11-18 14:34:40,669 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:34:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:34:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-18 14:34:40,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 14:34:40,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:34:40,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-18 14:34:40,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:34:40,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-18 14:34:40,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:34:40,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 130 transitions. [2018-11-18 14:34:40,672 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:34:40,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 0 states and 0 transitions. [2018-11-18 14:34:40,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 14:34:40,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 14:34:40,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 14:34:40,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:34:40,672 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:34:40,672 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:34:40,672 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:34:40,672 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 14:34:40,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:34:40,673 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:34:40,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 14:34:40,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 02:34:40 BoogieIcfgContainer [2018-11-18 14:34:40,678 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 14:34:40,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:34:40,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:34:40,679 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:34:40,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:34:35" (3/4) ... [2018-11-18 14:34:40,682 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 14:34:40,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:34:40,683 INFO L168 Benchmark]: Toolchain (without parser) took 5402.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 951.1 MB in the beginning and 877.1 MB in the end (delta: 74.0 MB). Peak memory consumption was 385.9 MB. Max. memory is 11.5 GB. [2018-11-18 14:34:40,683 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:34:40,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -204.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:34:40,684 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:34:40,685 INFO L168 Benchmark]: Boogie Preprocessor took 17.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:34:40,685 INFO L168 Benchmark]: RCFGBuilder took 198.55 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:34:40,685 INFO L168 Benchmark]: BuchiAutomizer took 4824.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 146.8 MB). Free memory was 1.1 GB in the beginning and 877.1 MB in the end (delta: 251.9 MB). Peak memory consumption was 398.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:34:40,686 INFO L168 Benchmark]: Witness Printer took 3.84 ms. Allocated memory is still 1.3 GB. Free memory is still 877.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:34:40,688 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -204.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 198.55 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4824.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 146.8 MB). Free memory was 1.1 GB in the beginning and 877.1 MB in the end (delta: 251.9 MB). Peak memory consumption was 398.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.84 ms. Allocated memory is still 1.3 GB. Free memory is still 877.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 3.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 52 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/12 HoareTripleCheckerStatistics: 136 SDtfs, 133 SDslu, 156 SDs, 0 SdLazy, 222 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital217 mio100 ax108 hnf100 lsp88 ukn60 mio100 lsp36 div100 bol100 ite100 ukn100 eq184 hnf88 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...