./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strtoull_true-termination.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_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strtoull_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/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 c35e01ca1f04f9c3fbc4be41bbbecfa6e73c3bc7 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:02:19,995 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:02:19,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:02:20,003 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:02:20,003 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:02:20,004 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:02:20,005 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:02:20,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:02:20,007 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:02:20,007 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:02:20,008 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:02:20,008 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:02:20,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:02:20,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:02:20,009 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:02:20,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:02:20,010 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:02:20,011 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:02:20,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:02:20,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:02:20,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:02:20,015 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:02:20,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:02:20,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:02:20,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:02:20,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:02:20,019 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:02:20,020 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:02:20,020 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:02:20,021 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:02:20,021 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:02:20,022 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:02:20,022 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:02:20,022 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:02:20,023 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:02:20,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:02:20,024 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 13:02:20,035 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:02:20,035 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:02:20,036 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:02:20,036 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:02:20,037 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:02:20,037 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:02:20,037 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:02:20,037 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:02:20,037 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:02:20,037 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:02:20,037 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:02:20,038 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:02:20,038 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:02:20,038 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:02:20,038 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:02:20,038 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:02:20,038 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:02:20,038 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:02:20,039 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:02:20,039 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:02:20,039 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:02:20,039 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:02:20,039 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:02:20,039 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:02:20,040 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:02:20,040 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:02:20,040 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:02:20,040 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:02:20,041 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_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/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 -> c35e01ca1f04f9c3fbc4be41bbbecfa6e73c3bc7 [2018-11-10 13:02:20,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:02:20,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:02:20,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:02:20,080 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:02:20,080 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:02:20,081 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtoull_true-termination.c.i [2018-11-10 13:02:20,133 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/bin-2019/uautomizer/data/a814c64fc/e390bed156414deb9f26cab72b1aa3c1/FLAG92d5f85e4 [2018-11-10 13:02:20,520 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:02:20,521 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/sv-benchmarks/c/termination-libowfat/strtoull_true-termination.c.i [2018-11-10 13:02:20,529 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/bin-2019/uautomizer/data/a814c64fc/e390bed156414deb9f26cab72b1aa3c1/FLAG92d5f85e4 [2018-11-10 13:02:20,539 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/bin-2019/uautomizer/data/a814c64fc/e390bed156414deb9f26cab72b1aa3c1 [2018-11-10 13:02:20,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:02:20,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:02:20,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:02:20,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:02:20,547 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:02:20,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:02:20" (1/1) ... [2018-11-10 13:02:20,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff1ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20, skipping insertion in model container [2018-11-10 13:02:20,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:02:20" (1/1) ... [2018-11-10 13:02:20,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:02:20,594 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:02:20,822 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:02:20,831 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:02:20,868 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:02:20,902 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:02:20,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20 WrapperNode [2018-11-10 13:02:20,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:02:20,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:02:20,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:02:20,904 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:02:20,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20" (1/1) ... [2018-11-10 13:02:20,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20" (1/1) ... [2018-11-10 13:02:20,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:02:20,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:02:20,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:02:20,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:02:20,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20" (1/1) ... [2018-11-10 13:02:20,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20" (1/1) ... [2018-11-10 13:02:21,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20" (1/1) ... [2018-11-10 13:02:21,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20" (1/1) ... [2018-11-10 13:02:21,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20" (1/1) ... [2018-11-10 13:02:21,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20" (1/1) ... [2018-11-10 13:02:21,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20" (1/1) ... [2018-11-10 13:02:21,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:02:21,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:02:21,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:02:21,012 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:02:21,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d83ec0fe-c3f6-43d3-bb68-b24b870daa31/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 13:02:21,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 13:02:21,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 13:02:21,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 13:02:21,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:02:21,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:02:21,334 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:02:21,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:02:21 BoogieIcfgContainer [2018-11-10 13:02:21,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:02:21,335 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:02:21,335 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:02:21,338 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:02:21,339 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:02:21,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:02:20" (1/3) ... [2018-11-10 13:02:21,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65d68f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:02:21, skipping insertion in model container [2018-11-10 13:02:21,340 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:02:21,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:20" (2/3) ... [2018-11-10 13:02:21,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65d68f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:02:21, skipping insertion in model container [2018-11-10 13:02:21,340 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:02:21,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:02:21" (3/3) ... [2018-11-10 13:02:21,342 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtoull_true-termination.c.i [2018-11-10 13:02:21,377 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:02:21,377 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:02:21,377 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:02:21,377 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:02:21,377 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:02:21,378 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:02:21,378 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:02:21,378 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:02:21,378 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:02:21,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2018-11-10 13:02:21,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-10 13:02:21,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:21,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:21,415 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:02:21,415 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 13:02:21,415 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:02:21,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2018-11-10 13:02:21,418 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-10 13:02:21,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:21,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:21,419 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:02:21,419 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 13:02:21,427 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~nondet23, main_#t~ret24, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 50#L551true assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 21#L553true SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L553 25#L553-1true main_~base~0 := main_#t~nondet23;havoc main_#t~nondet23;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;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];main_~#end~0.base, main_~#end~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 3#L555true SUMMARY for call write~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8); srcloc: L555 5#L555-1true assume { :begin_inline_strtoull } true;strtoull_#in~ptr.base, strtoull_#in~ptr.offset, strtoull_#in~endptr.base, strtoull_#in~endptr.offset, strtoull_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtoull_#res;havoc strtoull_#t~pre3.base, strtoull_#t~pre3.offset, strtoull_#t~mem2, strtoull_#t~mem4, strtoull_#t~post5.base, strtoull_#t~post5.offset, strtoull_#t~mem6, strtoull_#t~pre7.base, strtoull_#t~pre7.offset, strtoull_#t~mem8, strtoull_#t~short9, strtoull_~b~0, strtoull_#t~mem10, strtoull_#t~mem11, strtoull_#t~mem12, strtoull_#t~short13, strtoull_#t~mem14, strtoull_#t~ite17, strtoull_#t~ite16, strtoull_#t~ite15, strtoull_~x~0, strtoull_~w~0, strtoull_#t~pre18.base, strtoull_#t~pre18.offset, strtoull_~c~0, strtoull_#t~mem19, strtoull_#t~ite20, strtoull_~ptr.base, strtoull_~ptr.offset, strtoull_~endptr.base, strtoull_~endptr.offset, strtoull_~base, strtoull_~neg~0, strtoull_~v~0, strtoull_~orig~0.base, strtoull_~orig~0.offset, strtoull_~nptr~0.base, strtoull_~nptr~0.offset;strtoull_~ptr.base, strtoull_~ptr.offset := strtoull_#in~ptr.base, strtoull_#in~ptr.offset;strtoull_~endptr.base, strtoull_~endptr.offset := strtoull_#in~endptr.base, strtoull_#in~endptr.offset;strtoull_~base := strtoull_#in~base;strtoull_~neg~0 := 0;strtoull_~v~0 := 0;havoc strtoull_~orig~0.base, strtoull_~orig~0.offset;strtoull_~nptr~0.base, strtoull_~nptr~0.offset := strtoull_~ptr.base, strtoull_~ptr.offset; 10#L512-4true [2018-11-10 13:02:21,427 INFO L795 eck$LassoCheckResult]: Loop: 10#L512-4true assume true; 20#L512-1true SUMMARY for call strtoull_#t~mem2 := read~int(strtoull_~nptr~0.base, strtoull_~nptr~0.offset, 1); srcloc: L512-1 7#L512-2true assume !!(strtoull_#t~mem2 == 32);havoc strtoull_#t~mem2;strtoull_#t~pre3.base, strtoull_#t~pre3.offset := strtoull_~nptr~0.base, strtoull_~nptr~0.offset + 1;strtoull_~nptr~0.base, strtoull_~nptr~0.offset := strtoull_~nptr~0.base, strtoull_~nptr~0.offset + 1;havoc strtoull_#t~pre3.base, strtoull_#t~pre3.offset; 10#L512-4true [2018-11-10 13:02:21,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:21,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1806780582, now seen corresponding path program 1 times [2018-11-10 13:02:21,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:21,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:21,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:21,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:21,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:21,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:21,547 INFO L82 PathProgramCache]: Analyzing trace with hash 44755, now seen corresponding path program 1 times [2018-11-10 13:02:21,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:21,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:21,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:21,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:21,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:21,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:21,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1270179854, now seen corresponding path program 1 times [2018-11-10 13:02:21,559 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:21,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:21,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:21,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:21,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:22,015 WARN L179 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 117 [2018-11-10 13:02:22,180 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-10 13:02:22,192 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:02:22,194 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:02:22,194 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:02:22,194 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:02:22,194 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:02:22,194 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:02:22,195 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:02:22,195 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:02:22,195 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtoull_true-termination.c.i_Iteration1_Lasso [2018-11-10 13:02:22,195 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:02:22,196 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:02:22,219 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 13:02:22,228 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 13:02:22,231 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 13:02:22,233 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 13:02:22,235 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 13:02:22,240 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 13:02:22,242 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 13:02:22,244 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 13:02:22,246 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 13:02:22,248 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 13:02:22,250 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 13:02:22,253 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 13:02:22,256 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 13:02:22,258 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 13:02:22,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-10 13:02:22,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-10 13:02:22,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-10 13:02:22,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-10 13:02:22,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-10 13:02:22,440 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-11-10 13:02:22,508 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 13:02:22,510 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 13:02:22,511 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 13:02:22,514 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 13:02:22,515 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 13:02:22,517 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 13:02:22,519 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 13:02:22,521 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 13:02:22,522 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 13:02:22,524 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 13:02:22,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-10 13:02:22,527 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 13:02:22,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-10 13:02:22,530 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 13:02:22,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-10 13:02:22,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-10 13:02:22,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-10 13:02:22,536 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 13:02:22,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-10 13:02:22,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-10 13:02:22,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-10 13:02:22,897 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:02:22,901 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:02:22,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:22,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:22,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:22,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:22,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:22,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:22,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,951 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:22,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:22,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:22,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:22,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:22,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:22,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:22,979 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,980 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:02:22,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,983 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:02:22,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:22,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:22,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:22,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:22,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:22,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:22,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:22,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:22,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:23,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:23,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:23,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:23,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:02:23,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:23,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:23,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:23,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:02:23,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:02:23,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:23,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:23,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:23,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:23,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:23,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:23,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:23,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:23,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:02:23,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:02:23,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:02:23,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:02:23,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:02:23,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:02:23,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:02:23,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:02:23,079 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:02:23,104 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 13:02:23,105 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 13:02:23,107 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:02:23,108 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:02:23,109 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:02:23,109 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_1, ULTIMATE.start_strtoull_~nptr~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_1 - 1*ULTIMATE.start_strtoull_~nptr~0.offset Supporting invariants [] [2018-11-10 13:02:23,142 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 13:02:23,147 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 13:02:23,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:23,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:02:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:23,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:02:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:02:23,240 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 13:02:23,240 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states. Second operand 5 states. [2018-11-10 13:02:23,372 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states.. Second operand 5 states. Result 161 states and 224 transitions. Complement of second has 9 states. [2018-11-10 13:02:23,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 13:02:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 13:02:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2018-11-10 13:02:23,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 142 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-10 13:02:23,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:02:23,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 142 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-10 13:02:23,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:02:23,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 142 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-10 13:02:23,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:02:23,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 224 transitions. [2018-11-10 13:02:23,387 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:02:23,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 0 states and 0 transitions. [2018-11-10 13:02:23,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:02:23,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:02:23,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:02:23,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:02:23,391 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:02:23,391 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:02:23,391 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:02:23,392 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:02:23,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:02:23,392 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:02:23,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 13:02:23,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:02:23 BoogieIcfgContainer [2018-11-10 13:02:23,396 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:02:23,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:02:23,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:02:23,397 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:02:23,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:02:21" (3/4) ... [2018-11-10 13:02:23,400 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:02:23,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:02:23,401 INFO L168 Benchmark]: Toolchain (without parser) took 2858.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -145.4 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:23,401 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:02:23,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.71 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:23,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -200.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:23,403 INFO L168 Benchmark]: Boogie Preprocessor took 20.66 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:23,403 INFO L168 Benchmark]: RCFGBuilder took 323.02 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: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:23,404 INFO L168 Benchmark]: BuchiAutomizer took 2060.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.8 MB). Peak memory consumption was 62.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:23,404 INFO L168 Benchmark]: Witness Printer took 3.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:02:23,408 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.71 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -200.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.66 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 323.02 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: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2060.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.8 MB). Peak memory consumption was 62.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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-#length-unknown[__builtin_alloca (in_len)] + -1 * nptr and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 56 SDtfs, 108 SDslu, 62 SDs, 0 SdLazy, 52 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital189 mio100 ax100 hnf99 lsp90 ukn96 mio100 lsp34 div100 bol100 ite100 ukn100 eq201 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 4 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...