./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.04-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.04-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/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 ccf04b55a9dc12e714cd9b0ac904f1f1cad109e6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:13:49,428 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:13:49,429 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:13:49,435 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:13:49,435 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:13:49,436 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:13:49,436 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:13:49,437 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:13:49,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:13:49,438 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:13:49,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:13:49,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:13:49,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:13:49,440 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:13:49,441 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:13:49,442 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:13:49,442 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:13:49,443 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:13:49,445 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:13:49,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:13:49,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:13:49,446 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:13:49,447 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:13:49,448 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:13:49,448 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:13:49,448 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:13:49,449 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:13:49,449 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:13:49,449 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:13:49,450 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:13:49,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:13:49,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:13:49,450 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:13:49,450 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:13:49,451 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:13:49,452 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:13:49,452 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 05:13:49,460 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:13:49,460 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:13:49,461 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:13:49,461 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:13:49,462 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:13:49,462 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:13:49,462 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:13:49,462 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:13:49,462 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:13:49,462 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:13:49,462 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:13:49,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:13:49,463 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:13:49,463 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:13:49,463 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:13:49,463 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:13:49,463 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:13:49,463 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:13:49,463 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:13:49,464 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:13:49,464 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:13:49,464 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:13:49,464 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:13:49,464 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:13:49,464 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:13:49,464 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:13:49,465 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:13:49,465 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:13:49,465 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_2f5753ad-fe84-4ac3-9019-c1404e770182/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 -> ccf04b55a9dc12e714cd9b0ac904f1f1cad109e6 [2018-11-10 05:13:49,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:13:49,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:13:49,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:13:49,500 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:13:49,500 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:13:49,501 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.04-alloca_true-termination_true-no-overflow.c.i [2018-11-10 05:13:49,545 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/bin-2019/uautomizer/data/b527506d3/02cbd12bf1a64c62b1873b413693a6c8/FLAG4e6c4a79e [2018-11-10 05:13:49,910 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:13:49,910 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/sv-benchmarks/c/termination-memory-alloca/b.04-alloca_true-termination_true-no-overflow.c.i [2018-11-10 05:13:49,919 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/bin-2019/uautomizer/data/b527506d3/02cbd12bf1a64c62b1873b413693a6c8/FLAG4e6c4a79e [2018-11-10 05:13:49,931 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/bin-2019/uautomizer/data/b527506d3/02cbd12bf1a64c62b1873b413693a6c8 [2018-11-10 05:13:49,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:13:49,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:13:49,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:13:49,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:13:49,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:13:49,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:13:49" (1/1) ... [2018-11-10 05:13:49,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c80a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:49, skipping insertion in model container [2018-11-10 05:13:49,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:13:49" (1/1) ... [2018-11-10 05:13:49,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:13:49,976 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:13:50,158 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:13:50,166 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:13:50,190 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:13:50,221 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:13:50,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:50 WrapperNode [2018-11-10 05:13:50,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:13:50,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:13:50,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:13:50,222 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:13:50,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:50" (1/1) ... [2018-11-10 05:13:50,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:50" (1/1) ... [2018-11-10 05:13:50,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:13:50,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:13:50,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:13:50,288 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:13:50,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:50" (1/1) ... [2018-11-10 05:13:50,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:50" (1/1) ... [2018-11-10 05:13:50,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:50" (1/1) ... [2018-11-10 05:13:50,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:50" (1/1) ... [2018-11-10 05:13:50,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:50" (1/1) ... [2018-11-10 05:13:50,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:50" (1/1) ... [2018-11-10 05:13:50,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:50" (1/1) ... [2018-11-10 05:13:50,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:13:50,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:13:50,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:13:50,307 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:13:50,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f5753ad-fe84-4ac3-9019-c1404e770182/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-10 05:13:50,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:13:50,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:13:50,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:13:50,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:13:50,522 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:13:50,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:13:50 BoogieIcfgContainer [2018-11-10 05:13:50,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:13:50,523 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:13:50,523 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:13:50,525 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:13:50,526 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:13:50,526 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:13:49" (1/3) ... [2018-11-10 05:13:50,526 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24ce0065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:13:50, skipping insertion in model container [2018-11-10 05:13:50,526 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:13:50,526 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:13:50" (2/3) ... [2018-11-10 05:13:50,527 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24ce0065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:13:50, skipping insertion in model container [2018-11-10 05:13:50,527 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:13:50,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:13:50" (3/3) ... [2018-11-10 05:13:50,528 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.04-alloca_true-termination_true-no-overflow.c.i [2018-11-10 05:13:50,562 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:13:50,562 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:13:50,563 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:13:50,563 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:13:50,563 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:13:50,563 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:13:50,563 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:13:50,563 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:13:50,563 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:13:50,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 05:13:50,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 05:13:50,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:13:50,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:13:50,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 05:13:50,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:50,594 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:13:50,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 05:13:50,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 05:13:50,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:13:50,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:13:50,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 05:13:50,597 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:13:50,603 INFO L793 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~ret14;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~tmp := main_#t~nondet11, main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~tmp, 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_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~tmp := test_fun_#in~tmp;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 19#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 20#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 15#L553true SUMMARY for call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4); srcloc: L553 21#L555-4true [2018-11-10 05:13:50,604 INFO L795 eck$LassoCheckResult]: Loop: 21#L555-4true assume true; 9#L555true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 12#L555-1true SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 16#L555-2true assume !!(test_fun_#t~mem5 > test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 6#L556true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 10#L556-1true SUMMARY for call write~int(test_fun_#t~mem7, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4); srcloc: L556-1 13#L556-2true havoc test_fun_#t~mem7; 4#L557true SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 7#L557-1true SUMMARY for call write~int(test_fun_#t~mem8, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 11#L557-2true havoc test_fun_#t~mem8; 3#L558true SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4); srcloc: L558 5#L558-1true SUMMARY for call write~int(test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 8#L558-2true havoc test_fun_#t~mem9; 21#L555-4true [2018-11-10 05:13:50,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:50,609 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 05:13:50,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:13:50,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:13:50,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:50,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:50,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:13:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:13:50,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:50,720 INFO L82 PathProgramCache]: Analyzing trace with hash 911041262, now seen corresponding path program 1 times [2018-11-10 05:13:50,720 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:13:50,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:13:50,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:50,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:50,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:13:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:13:50,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:50,751 INFO L82 PathProgramCache]: Analyzing trace with hash 954591694, now seen corresponding path program 1 times [2018-11-10 05:13:50,751 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:13:50,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:13:50,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:50,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:13:50,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:13:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:13:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:13:51,178 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2018-11-10 05:13:51,287 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:13:51,288 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:13:51,288 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:13:51,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:13:51,289 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:13:51,289 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:13:51,289 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:13:51,289 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:13:51,289 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.04-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-10 05:13:51,289 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:13:51,290 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:13:51,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-10 05:13:51,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,690 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2018-11-10 05:13:51,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:51,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:13:52,248 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:13:52,251 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:13:52,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 05:13:52,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:13:52,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:13:52,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:13:52,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:13:52,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:13:52,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:13:52,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:13:52,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:13:52,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 05:13:52,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:13:52,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:13:52,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:13:52,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:13:52,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:13:52,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:13:52,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:13:52,259 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:13:52,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 05:13:52,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:13:52,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:13:52,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:13:52,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:13:52,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:13:52,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:13:52,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:13:52,264 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:13:52,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 05:13:52,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:13:52,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:13:52,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:13:52,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:13:52,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:13:52,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:13:52,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:13:52,266 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:13:52,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:13:52,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:13:52,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:13:52,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:13:52,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:13:52,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:13:52,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:13:52,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:13:52,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 05:13:52,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:13:52,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:13:52,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:13:52,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:13:52,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:13:52,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:13:52,298 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:13:52,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 05:13:52,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:13:52,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:13:52,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:13:52,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:13:52,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:13:52,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:13:52,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:13:52,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10 05:13:52,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:13:52,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:13:52,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:13:52,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:13:52,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:13:52,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:13:52,339 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:13:52,365 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 05:13:52,365 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 05:13:52,367 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:13:52,368 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:13:52,368 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:13:52,369 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, 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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_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-10 05:13:52,431 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 05:13:52,435 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:13:52,436 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:13:52,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:52,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:13:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:52,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:13:52,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 63 [2018-11-10 05:13:52,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-10 05:13:52,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:52,672 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:52,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:52,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 50 [2018-11-10 05:13:52,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 05:13:52,719 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:52,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 56 [2018-11-10 05:13:52,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 05:13:52,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:13:52,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:13:52,791 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:42, output treesize:92 [2018-11-10 05:13:52,857 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:13:52,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-11-10 05:13:52,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-10 05:13:52,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:52,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:13:52,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 44 [2018-11-10 05:13:52,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-10 05:13:52,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:52,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:13:52,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:52,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 53 treesize of output 78 [2018-11-10 05:13:52,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 66 [2018-11-10 05:13:53,001 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 05:13:53,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:53,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-11-10 05:13:53,137 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:53,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:53,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2018-11-10 05:13:53,230 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-10 05:13:53,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:53,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:53,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 57 [2018-11-10 05:13:53,286 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:53,315 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 05:13:53,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-10 05:13:53,354 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:137, output treesize:191 [2018-11-10 05:13:53,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 05:13:53,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-10 05:13:53,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:53,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:13:53,575 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:53,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 67 [2018-11-10 05:13:53,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 61 [2018-11-10 05:13:53,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:53,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:53,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-11-10 05:13:53,617 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:53,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:13:53,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 38 [2018-11-10 05:13:53,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 05:13:53,694 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:53,706 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:13:53,745 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:53,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 68 [2018-11-10 05:13:53,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-11-10 05:13:53,758 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:53,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:53,785 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:53,786 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:53,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 63 [2018-11-10 05:13:53,787 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:53,803 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:13:53,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-10 05:13:53,841 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:189, output treesize:221 [2018-11-10 05:13:53,943 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-10 05:13:53,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2018-11-10 05:13:53,954 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 12 states. [2018-11-10 05:13:54,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 12 states. Result 64 states and 65 transitions. Complement of second has 18 states. [2018-11-10 05:13:54,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 05:13:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 05:13:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2018-11-10 05:13:54,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 5 letters. Loop has 13 letters. [2018-11-10 05:13:54,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:13:54,057 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:13:54,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:13:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:54,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:13:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:13:54,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:13:54,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 63 [2018-11-10 05:13:54,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:54,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:54,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 50 [2018-11-10 05:13:54,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 05:13:54,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-10 05:13:54,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:54,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:54,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 56 [2018-11-10 05:13:54,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 05:13:54,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:13:54,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:13:54,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:42, output treesize:92 [2018-11-10 05:13:54,446 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:13:54,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-11-10 05:13:54,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-10 05:13:54,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:54,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:13:54,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:54,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 53 treesize of output 78 [2018-11-10 05:13:54,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-11-10 05:13:54,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:54,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:54,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:54,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 61 [2018-11-10 05:13:54,581 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:54,628 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:54,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2018-11-10 05:13:54,633 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 05:13:54,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:54,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:54,676 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:54,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 66 [2018-11-10 05:13:54,683 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-10 05:13:54,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 05:13:54,768 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:13:54,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-11-10 05:13:54,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-10 05:13:54,772 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:54,777 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:13:54,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-10 05:13:54,820 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:137, output treesize:194 [2018-11-10 05:13:54,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:54,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 67 [2018-11-10 05:13:54,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 61 [2018-11-10 05:13:54,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:55,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:55,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-11-10 05:13:55,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:55,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:13:55,061 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:13:55,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-10 05:13:55,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-11-10 05:13:55,063 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:55,067 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:13:55,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 05:13:55,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-10 05:13:55,106 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:55,110 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:13:55,147 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:55,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 68 [2018-11-10 05:13:55,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-11-10 05:13:55,162 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:55,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:13:55,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 56 [2018-11-10 05:13:55,205 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 05:13:55,227 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:13:55,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-10 05:13:55,270 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:189, output treesize:224 [2018-11-10 05:13:55,374 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-10 05:13:55,374 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 10 loop predicates [2018-11-10 05:13:55,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 12 states. [2018-11-10 05:13:55,675 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2018-11-10 05:13:55,722 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 12 states. Result 49 states and 51 transitions. Complement of second has 23 states. [2018-11-10 05:13:55,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-10 05:13:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 05:13:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 30 transitions. [2018-11-10 05:13:55,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 30 transitions. Stem has 5 letters. Loop has 13 letters. [2018-11-10 05:13:55,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:13:55,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 30 transitions. Stem has 18 letters. Loop has 13 letters. [2018-11-10 05:13:55,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:13:55,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 30 transitions. Stem has 5 letters. Loop has 26 letters. [2018-11-10 05:13:55,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:13:55,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 51 transitions. [2018-11-10 05:13:55,726 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:13:55,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2018-11-10 05:13:55,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:13:55,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:13:55,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:13:55,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:13:55,729 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:13:55,729 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:13:55,729 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:13:55,729 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:13:55,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:13:55,729 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:13:55,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:13:55,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:13:55 BoogieIcfgContainer [2018-11-10 05:13:55,733 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:13:55,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:13:55,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:13:55,733 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:13:55,734 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:13:50" (3/4) ... [2018-11-10 05:13:55,736 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:13:55,736 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:13:55,737 INFO L168 Benchmark]: Toolchain (without parser) took 5802.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -193.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:13:55,737 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:13:55,737 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.14 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:13:55,738 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:13:55,738 INFO L168 Benchmark]: Boogie Preprocessor took 18.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:13:55,738 INFO L168 Benchmark]: RCFGBuilder took 216.54 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:13:55,739 INFO L168 Benchmark]: BuchiAutomizer took 5209.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -38.5 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:13:55,739 INFO L168 Benchmark]: Witness Printer took 2.92 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:13:55,741 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.14 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -205.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 216.54 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5209.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -38.5 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.92 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [0, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 25 SDtfs, 36 SDslu, 80 SDs, 0 SdLazy, 133 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital412 mio100 ax104 hnf100 lsp94 ukn60 mio100 lsp38 div100 bol100 ite100 ukn100 eq193 hnf87 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...