./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/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 051dd1d5deb7603ef8d45e2ac843d269d4cbaf6c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:25:02,899 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:25:02,900 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:25:02,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:25:02,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:25:02,908 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:25:02,909 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:25:02,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:25:02,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:25:02,911 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:25:02,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:25:02,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:25:02,913 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:25:02,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:25:02,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:25:02,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:25:02,916 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:25:02,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:25:02,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:25:02,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:25:02,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:25:02,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:25:02,922 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:25:02,922 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:25:02,922 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:25:02,923 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:25:02,924 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:25:02,924 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:25:02,925 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:25:02,925 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:25:02,926 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:25:02,926 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:25:02,926 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:25:02,926 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:25:02,927 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:25:02,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:25:02,928 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 10:25:02,938 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:25:02,938 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:25:02,939 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:25:02,940 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:25:02,940 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:25:02,940 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:25:02,940 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:25:02,940 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:25:02,940 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:25:02,940 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:25:02,941 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:25:02,941 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:25:02,941 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:25:02,941 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:25:02,941 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:25:02,941 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:25:02,941 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:25:02,942 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:25:02,942 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:25:02,942 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:25:02,942 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:25:02,942 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:25:02,942 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:25:02,942 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:25:02,943 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:25:02,943 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:25:02,943 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:25:02,943 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:25:02,944 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:25:02,944 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_beb88055-5e24-406a-a89f-402cce3596a0/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 -> 051dd1d5deb7603ef8d45e2ac843d269d4cbaf6c [2018-11-18 10:25:02,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:25:02,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:25:02,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:25:02,980 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:25:02,980 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:25:02,981 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca_true-termination.c.i [2018-11-18 10:25:03,024 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/bin-2019/uautomizer/data/ca225855f/854c7278ca93461c9b7f0f32e9841a78/FLAGd46314aa8 [2018-11-18 10:25:03,484 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:25:03,485 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca_true-termination.c.i [2018-11-18 10:25:03,491 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/bin-2019/uautomizer/data/ca225855f/854c7278ca93461c9b7f0f32e9841a78/FLAGd46314aa8 [2018-11-18 10:25:03,998 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/bin-2019/uautomizer/data/ca225855f/854c7278ca93461c9b7f0f32e9841a78 [2018-11-18 10:25:04,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:25:04,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:25:04,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:25:04,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:25:04,005 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:25:04,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:25:03" (1/1) ... [2018-11-18 10:25:04,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5102b6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04, skipping insertion in model container [2018-11-18 10:25:04,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:25:03" (1/1) ... [2018-11-18 10:25:04,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:25:04,040 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:25:04,245 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:25:04,252 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:25:04,331 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:25:04,371 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:25:04,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04 WrapperNode [2018-11-18 10:25:04,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:25:04,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:25:04,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:25:04,372 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:25:04,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04" (1/1) ... [2018-11-18 10:25:04,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04" (1/1) ... [2018-11-18 10:25:04,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:25:04,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:25:04,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:25:04,398 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:25:04,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04" (1/1) ... [2018-11-18 10:25:04,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04" (1/1) ... [2018-11-18 10:25:04,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04" (1/1) ... [2018-11-18 10:25:04,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04" (1/1) ... [2018-11-18 10:25:04,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04" (1/1) ... [2018-11-18 10:25:04,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04" (1/1) ... [2018-11-18 10:25:04,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04" (1/1) ... [2018-11-18 10:25:04,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:25:04,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:25:04,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:25:04,416 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:25:04,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_beb88055-5e24-406a-a89f-402cce3596a0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:25:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:25:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:25:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:25:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:25:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:25:04,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:25:04,592 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:25:04,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:25:04 BoogieIcfgContainer [2018-11-18 10:25:04,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:25:04,593 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:25:04,593 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:25:04,595 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:25:04,596 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:25:04,596 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:25:03" (1/3) ... [2018-11-18 10:25:04,596 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@317a1466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:25:04, skipping insertion in model container [2018-11-18 10:25:04,596 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:25:04,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:25:04" (2/3) ... [2018-11-18 10:25:04,597 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@317a1466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:25:04, skipping insertion in model container [2018-11-18 10:25:04,597 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:25:04,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:25:04" (3/3) ... [2018-11-18 10:25:04,598 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcmp_mixed_alloca_true-termination.c.i [2018-11-18 10:25:04,636 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:25:04,636 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:25:04,636 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:25:04,636 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:25:04,636 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:25:04,636 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:25:04,637 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:25:04,637 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:25:04,637 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:25:04,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 10:25:04,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 10:25:04,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:25:04,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:25:04,669 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 10:25:04,669 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:25:04,669 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:25:04,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 10:25:04,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 10:25:04,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:25:04,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:25:04,672 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 10:25:04,672 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:25:04,678 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 18#L378true assume !(main_~length1~0 < 1); 4#L378-2true assume !(main_~length2~0 < 1); 14#L381-1true call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 9#L367-6true [2018-11-18 10:25:04,678 INFO L796 eck$LassoCheckResult]: Loop: 9#L367-6true assume true; 3#L367-1true call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 5#L367-2true assume cstrcmp_#t~short208;call cstrcmp_#t~mem206 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem207 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short208 := cstrcmp_#t~mem206 == cstrcmp_#t~mem207; 6#L367-4true assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem206;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 9#L367-6true [2018-11-18 10:25:04,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:25:04,682 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 10:25:04,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:25:04,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:25:04,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:25:04,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:25:04,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:25:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:25:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:25:04,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:25:04,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 1 times [2018-11-18 10:25:04,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:25:04,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:25:04,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:25:04,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:25:04,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:25:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:25:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:25:04,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:25:04,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1298317104, now seen corresponding path program 1 times [2018-11-18 10:25:04,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:25:04,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:25:04,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:25:04,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:25:04,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:25:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:25:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:25:04,983 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2018-11-18 10:25:05,203 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-18 10:25:05,285 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:25:05,285 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:25:05,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:25:05,286 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:25:05,286 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:25:05,286 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:25:05,286 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:25:05,286 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:25:05,286 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp_mixed_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 10:25:05,286 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:25:05,287 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:25:05,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,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-18 10:25:05,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,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-18 10:25:05,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,524 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2018-11-18 10:25:05,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:25:05,935 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:25:05,940 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:25:05,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:05,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:05,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:05,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:05,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:05,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:25:05,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:05,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:05,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:05,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:05,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:05,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:05,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:05,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:25:05,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:05,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:05,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-18 10:25:05,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:05,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:05,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:05,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:05,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:25:05,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:05,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:05,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-18 10:25:05,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:05,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:05,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:05,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:25:05,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:25:05,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:05,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:05,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:05,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:05,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:05,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:05,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:25:05,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:05,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:05,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:05,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:05,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:05,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:05,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:05,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:25:05,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:05,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:05,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:05,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:05,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:05,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:05,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:05,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:25:05,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:05,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:05,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:05,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:05,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:05,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:05,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:25:05,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:25:05,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:05,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:05,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:05,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:05,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:05,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:05,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:25:05,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:05,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:05,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:05,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:05,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:05,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:05,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:05,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:25:05,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:05,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:05,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:05,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:05,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:05,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:05,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:05,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:25:05,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:05,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:05,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:05,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:05,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:05,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:05,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:05,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:25:05,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:05,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:05,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:05,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:05,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:06,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:06,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:06,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:06,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:25:06,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:06,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:06,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:06,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:06,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:06,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:06,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:06,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:06,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:25:06,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:06,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:06,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:06,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:06,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:06,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:06,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:06,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:25:06,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:25:06,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:06,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:06,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:06,027 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:25:06,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:06,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:06,029 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:25:06,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:25:06,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:06,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:06,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:06,043 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:25:06,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:06,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:06,045 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:25:06,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:25:06,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:06,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:06,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:06,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:06,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:06,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:06,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:25:06,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:25:06,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:06,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:06,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:06,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:25:06,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:06,065 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:25:06,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:06,066 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:25:06,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:25:06,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:06,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:06,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:06,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:06,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:06,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:06,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:25:06,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:25:06,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:06,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:06,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:06,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:06,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:06,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:06,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:25:06,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:25:06,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:06,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:06,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:06,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:06,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:06,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:06,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:25:06,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:25:06,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:25:06,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:25:06,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:25:06,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:25:06,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:25:06,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:25:06,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:25:06,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:25:06,136 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:25:06,159 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:25:06,160 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 10:25:06,161 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:25:06,163 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:25:06,163 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:25:06,164 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset) = 2*ULTIMATE.start_cstrcmp_~s2.offset + 1 Supporting invariants [] [2018-11-18 10:25:06,230 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 10:25:06,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:25:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:25:06,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:25:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:25:06,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:25:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:25:06,307 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:25:06,308 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2018-11-18 10:25:06,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 7 states. [2018-11-18 10:25:06,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:25:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:25:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-18 10:25:06,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-18 10:25:06,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:25:06,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-18 10:25:06,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:25:06,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-18 10:25:06,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:25:06,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-18 10:25:06,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 10:25:06,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 17 states and 22 transitions. [2018-11-18 10:25:06,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 10:25:06,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 10:25:06,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-18 10:25:06,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:25:06,349 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-18 10:25:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-18 10:25:06,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-18 10:25:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 10:25:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-11-18 10:25:06,365 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-18 10:25:06,365 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-18 10:25:06,365 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:25:06,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2018-11-18 10:25:06,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 10:25:06,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:25:06,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:25:06,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:25:06,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:25:06,367 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 163#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 164#L378 assume !(main_~length1~0 < 1); 172#L378-2 assume !(main_~length2~0 < 1); 173#L381-1 call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);assume { :begin_inline_cstrcmp } true;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 177#L367-6 assume true; 166#L367-1 [2018-11-18 10:25:06,367 INFO L796 eck$LassoCheckResult]: Loop: 166#L367-1 call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 169#L367-2 assume !cstrcmp_#t~short208; 174#L367-4 assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem206;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 165#L367-6 assume true; 166#L367-1 [2018-11-18 10:25:06,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:25:06,367 INFO L82 PathProgramCache]: Analyzing trace with hash 889572237, now seen corresponding path program 1 times [2018-11-18 10:25:06,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:25:06,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:25:06,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:25:06,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:25:06,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:25:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:25:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:25:06,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:25:06,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1575129, now seen corresponding path program 1 times [2018-11-18 10:25:06,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:25:06,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:25:06,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:25:06,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:25:06,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:25:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:25:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:25:06,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:25:06,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:25:06,417 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:25:06,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:25:06,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:25:06,421 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-18 10:25:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:25:06,436 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-18 10:25:06,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:25:06,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-18 10:25:06,438 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:25:06,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2018-11-18 10:25:06,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 10:25:06,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 10:25:06,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 10:25:06,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:25:06,438 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:25:06,439 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:25:06,439 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:25:06,439 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:25:06,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:25:06,439 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:25:06,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 10:25:06,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:25:06 BoogieIcfgContainer [2018-11-18 10:25:06,447 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:25:06,447 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:25:06,447 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:25:06,448 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:25:06,448 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:25:04" (3/4) ... [2018-11-18 10:25:06,451 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 10:25:06,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:25:06,452 INFO L168 Benchmark]: Toolchain (without parser) took 2451.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.5 MB). Free memory was 957.0 MB in the beginning and 1.2 GB in the end (delta: -205.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:25:06,453 INFO L168 Benchmark]: CDTParser took 0.15 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-18 10:25:06,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:25:06,453 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.60 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:25:06,454 INFO L168 Benchmark]: Boogie Preprocessor took 17.79 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-18 10:25:06,454 INFO L168 Benchmark]: RCFGBuilder took 176.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:25:06,455 INFO L168 Benchmark]: BuchiAutomizer took 1854.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -52.9 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-18 10:25:06,455 INFO L168 Benchmark]: Witness Printer took 3.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:25:06,458 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 369.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.60 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 176.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1854.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -52.9 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * s2 + 1 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. 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 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 18 SDslu, 21 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital212 mio100 ax100 hnf100 lsp97 ukn85 mio100 lsp50 div100 bol100 ite100 ukn100 eq188 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 4 VariablesLoop: 3 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...