./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/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 54ff0e2671f1fbdd267f9aba90cfe8fb60d3ccde ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 14:40:12,400 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:40:12,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:40:12,408 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:40:12,409 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:40:12,409 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:40:12,410 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:40:12,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:40:12,412 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:40:12,412 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:40:12,413 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:40:12,413 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:40:12,413 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:40:12,414 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:40:12,414 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:40:12,415 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:40:12,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:40:12,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:40:12,417 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:40:12,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:40:12,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:40:12,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:40:12,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:40:12,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:40:12,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:40:12,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:40:12,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:40:12,422 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:40:12,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:40:12,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:40:12,423 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:40:12,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:40:12,424 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:40:12,424 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:40:12,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:40:12,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:40:12,425 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 14:40:12,433 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:40:12,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:40:12,434 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 14:40:12,434 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 14:40:12,434 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 14:40:12,434 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 14:40:12,435 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 14:40:12,435 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 14:40:12,435 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 14:40:12,435 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 14:40:12,435 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 14:40:12,435 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:40:12,435 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 14:40:12,435 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:40:12,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:40:12,436 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 14:40:12,436 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 14:40:12,436 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 14:40:12,436 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 14:40:12,436 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 14:40:12,436 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 14:40:12,436 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 14:40:12,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:40:12,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 14:40:12,437 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 14:40:12,437 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:40:12,437 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 14:40:12,437 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 14:40:12,438 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 14:40:12,438 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_998faf92-926f-4f29-b4ae-3edaeb811f70/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 -> 54ff0e2671f1fbdd267f9aba90cfe8fb60d3ccde [2018-12-08 14:40:12,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:40:12,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:40:12,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:40:12,464 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:40:12,464 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:40:12,464 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i [2018-12-08 14:40:12,497 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/bin-2019/uautomizer/data/64fab9946/f580261a89b24e4ba14466564ed385c8/FLAG4e16f4992 [2018-12-08 14:40:13,001 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:40:13,002 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i [2018-12-08 14:40:13,007 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/bin-2019/uautomizer/data/64fab9946/f580261a89b24e4ba14466564ed385c8/FLAG4e16f4992 [2018-12-08 14:40:13,015 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/bin-2019/uautomizer/data/64fab9946/f580261a89b24e4ba14466564ed385c8 [2018-12-08 14:40:13,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:40:13,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 14:40:13,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:40:13,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:40:13,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:40:13,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:40:13" (1/1) ... [2018-12-08 14:40:13,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264a29c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13, skipping insertion in model container [2018-12-08 14:40:13,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:40:13" (1/1) ... [2018-12-08 14:40:13,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:40:13,043 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:40:13,184 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:40:13,232 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:40:13,255 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:40:13,280 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:40:13,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13 WrapperNode [2018-12-08 14:40:13,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:40:13,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 14:40:13,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 14:40:13,281 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 14:40:13,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13" (1/1) ... [2018-12-08 14:40:13,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13" (1/1) ... [2018-12-08 14:40:13,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 14:40:13,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:40:13,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:40:13,310 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:40:13,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13" (1/1) ... [2018-12-08 14:40:13,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13" (1/1) ... [2018-12-08 14:40:13,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13" (1/1) ... [2018-12-08 14:40:13,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13" (1/1) ... [2018-12-08 14:40:13,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13" (1/1) ... [2018-12-08 14:40:13,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13" (1/1) ... [2018-12-08 14:40:13,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13" (1/1) ... [2018-12-08 14:40:13,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:40:13,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:40:13,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:40:13,328 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:40:13,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/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-12-08 14:40:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 14:40:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 14:40:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 14:40:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 14:40:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:40:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:40:13,518 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:40:13,518 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 14:40:13,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:40:13 BoogieIcfgContainer [2018-12-08 14:40:13,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:40:13,519 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 14:40:13,519 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 14:40:13,522 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 14:40:13,523 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:40:13,523 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 02:40:13" (1/3) ... [2018-12-08 14:40:13,524 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7917ff2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 02:40:13, skipping insertion in model container [2018-12-08 14:40:13,524 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:40:13,524 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:40:13" (2/3) ... [2018-12-08 14:40:13,525 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7917ff2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 02:40:13, skipping insertion in model container [2018-12-08 14:40:13,525 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:40:13,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:40:13" (3/3) ... [2018-12-08 14:40:13,526 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca_true-termination.c.i [2018-12-08 14:40:13,560 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 14:40:13,560 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 14:40:13,560 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 14:40:13,560 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 14:40:13,560 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 14:40:13,560 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 14:40:13,560 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 14:40:13,560 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 14:40:13,560 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 14:40:13,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 14:40:13,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 14:40:13,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:40:13,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:40:13,585 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 14:40:13,585 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 14:40:13,585 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 14:40:13,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 14:40:13,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 14:40:13,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:40:13,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:40:13,587 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 14:40:13,587 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 14:40:13,591 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 7#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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 + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 3#L552-4true [2018-12-08 14:40:13,592 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 5#L557true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 20#L552-3true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 3#L552-4true [2018-12-08 14:40:13,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-08 14:40:13,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:40:13,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:40:13,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:13,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:40:13,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:13,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-08 14:40:13,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:40:13,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:40:13,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:13,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:40:13,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:40:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:40:13,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:40:13,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:40:13,702 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 14:40:13,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 14:40:13,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 14:40:13,712 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-08 14:40:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:40:13,716 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-08 14:40:13,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 14:40:13,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-08 14:40:13,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 14:40:13,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-08 14:40:13,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 14:40:13,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 14:40:13,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-08 14:40:13,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 14:40:13,722 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-08 14:40:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-08 14:40:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-08 14:40:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-08 14:40:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-08 14:40:13,738 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-08 14:40:13,738 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-08 14:40:13,738 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 14:40:13,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-08 14:40:13,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 14:40:13,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:40:13,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:40:13,739 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 14:40:13,739 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:40:13,739 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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 + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 44#L552-4 [2018-12-08 14:40:13,739 INFO L796 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 56#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 51#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 52#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 55#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 46#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 47#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 44#L552-4 [2018-12-08 14:40:13,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:13,739 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-08 14:40:13,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:40:13,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:40:13,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:13,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:40:13,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:13,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-08 14:40:13,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:40:13,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:40:13,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:13,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:40:13,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:13,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:13,776 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-08 14:40:13,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:40:13,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:40:13,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:13,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:40:13,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:13,926 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-12-08 14:40:14,072 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-08 14:40:14,225 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-08 14:40:14,292 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 14:40:14,292 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 14:40:14,292 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 14:40:14,292 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 14:40:14,293 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 14:40:14,293 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:40:14,293 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 14:40:14,293 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 14:40:14,293 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-08 14:40:14,293 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 14:40:14,293 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 14:40:14,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-12-08 14:40:14,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,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-12-08 14:40:14,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,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-12-08 14:40:14,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:14,903 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-12-08 14:40:15,024 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 14:40:15,027 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 14:40:15,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-12-08 14:40:15,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:15,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:15,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:15,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:15,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,032 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-12-08 14:40:15,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:15,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:15,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:15,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:15,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,034 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-12-08 14:40:15,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:15,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:15,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:15,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,038 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-12-08 14:40:15,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:15,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:15,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:15,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:15,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,039 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-12-08 14:40:15,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:15,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:15,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:15,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,043 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-12-08 14:40:15,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:15,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:15,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:15,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,051 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-12-08 14:40:15,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:15,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:15,052 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-08 14:40:15,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,054 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:40:15,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:15,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,063 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-12-08 14:40:15,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,064 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:40:15,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,066 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:40:15,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:15,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,074 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-12-08 14:40:15,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:15,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:15,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:15,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,084 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-12-08 14:40:15,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:15,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:15,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:15,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,087 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-12-08 14:40:15,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:15,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:15,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:15,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:15,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,089 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-12-08 14:40:15,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,090 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:40:15,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,091 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:40:15,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:15,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,097 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-12-08 14:40:15,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:15,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:15,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:15,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:15,099 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-12-08 14:40:15,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:15,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:15,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:15,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:15,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:15,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:15,111 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 14:40:15,122 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 14:40:15,122 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 14:40:15,123 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 14:40:15,124 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 14:40:15,124 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 14:40:15,124 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-12-08 14:40:15,152 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-08 14:40:15,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 14:40:15,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:40:15,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:40:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:40:15,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:40:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:40:15,219 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-12-08 14:40:15,219 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-08 14:40:15,260 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-12-08 14:40:15,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 14:40:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 14:40:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-08 14:40:15,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-08 14:40:15,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:40:15,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-08 14:40:15,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:40:15,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-08 14:40:15,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:40:15,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-08 14:40:15,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 14:40:15,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-08 14:40:15,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 14:40:15,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 14:40:15,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-08 14:40:15,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 14:40:15,266 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 14:40:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-08 14:40:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-08 14:40:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-08 14:40:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-08 14:40:15,267 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 14:40:15,267 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 14:40:15,267 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 14:40:15,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-08 14:40:15,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 14:40:15,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:40:15,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:40:15,268 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:40:15,268 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 14:40:15,269 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 191#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 185#L565 assume !(main_~length1~0 < 1); 186#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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 + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 178#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 180#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 193#L555-5 [2018-12-08 14:40:15,269 INFO L796 eck$LassoCheckResult]: Loop: 193#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 187#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 188#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 193#L555-5 [2018-12-08 14:40:15,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:15,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-08 14:40:15,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:40:15,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:40:15,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:15,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:40:15,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:15,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:15,289 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-08 14:40:15,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:40:15,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:40:15,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:15,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:40:15,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:15,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:15,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-08 14:40:15,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:40:15,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:40:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:15,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:40:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:15,595 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-12-08 14:40:15,661 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 14:40:15,661 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 14:40:15,661 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 14:40:15,661 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 14:40:15,661 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 14:40:15,661 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:40:15,662 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 14:40:15,662 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 14:40:15,662 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-08 14:40:15,662 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 14:40:15,662 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 14:40:15,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:15,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:40:16,231 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-12-08 14:40:16,284 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 14:40:16,285 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 14:40:16,285 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-12-08 14:40:16,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,288 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-12-08 14:40:16,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,290 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-12-08 14:40:16,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,292 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-12-08 14:40:16,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,294 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-12-08 14:40:16,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,296 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-12-08 14:40:16,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:16,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:16,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,300 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-12-08 14:40:16,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:16,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:16,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:40:16,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,318 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-12-08 14:40:16,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:16,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:16,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,320 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-12-08 14:40:16,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,322 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-12-08 14:40:16,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,324 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-12-08 14:40:16,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,326 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-12-08 14:40:16,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,327 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-12-08 14:40:16,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,329 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-12-08 14:40:16,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,331 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-12-08 14:40:16,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:40:16,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:40:16,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:40:16,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,332 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-12-08 14:40:16,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:16,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:16,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,338 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-12-08 14:40:16,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:16,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:16,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,341 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-12-08 14:40:16,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,342 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:40:16,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,343 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:40:16,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:16,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,349 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-12-08 14:40:16,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:16,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:16,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,352 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-12-08 14:40:16,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,352 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:40:16,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,353 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:40:16,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:16,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,359 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-12-08 14:40:16,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:16,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:16,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,362 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-12-08 14:40:16,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:16,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:16,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,365 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-12-08 14:40:16,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,365 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:40:16,365 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-08 14:40:16,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,377 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-12-08 14:40:16,377 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-08 14:40:16,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:40:16,421 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-12-08 14:40:16,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:40:16,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:40:16,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:40:16,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:40:16,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:40:16,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:40:16,429 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 14:40:16,438 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 14:40:16,438 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 14:40:16,439 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 14:40:16,439 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 14:40:16,439 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 14:40:16,439 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-12-08 14:40:16,478 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-12-08 14:40:16,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 14:40:16,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:40:16,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:40:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:40:16,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:40:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:40:16,525 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-12-08 14:40:16,525 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-08 14:40:16,556 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-12-08 14:40:16,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 14:40:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 14:40:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-08 14:40:16,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-08 14:40:16,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:40:16,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-08 14:40:16,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:40:16,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-08 14:40:16,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:40:16,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-08 14:40:16,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 14:40:16,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-08 14:40:16,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 14:40:16,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 14:40:16,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-08 14:40:16,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 14:40:16,559 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-08 14:40:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-08 14:40:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-08 14:40:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 14:40:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-08 14:40:16,560 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-08 14:40:16,560 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-08 14:40:16,560 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 14:40:16,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-08 14:40:16,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 14:40:16,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:40:16,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:40:16,561 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:40:16,561 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 14:40:16,561 INFO L794 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 372#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 366#L565 assume !(main_~length1~0 < 1); 367#L565-2 assume !(main_~length2~0 < 1); 365#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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 + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 358#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 359#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 375#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 380#L555-1 assume !cstrcspn_#t~short7; 379#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 378#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 363#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 364#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 360#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 362#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 374#L555-5 [2018-12-08 14:40:16,561 INFO L796 eck$LassoCheckResult]: Loop: 374#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 368#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 369#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 374#L555-5 [2018-12-08 14:40:16,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-08 14:40:16,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:40:16,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:40:16,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:16,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:40:16,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:16,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:16,573 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-08 14:40:16,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:40:16,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:40:16,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:16,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:40:16,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:40:16,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:40:16,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-12-08 14:40:16,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:40:16,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:40:16,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:16,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:40:16,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:40:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:40:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:40:16,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:40:16,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_998faf92-926f-4f29-b4ae-3edaeb811f70/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:40:16,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:40:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:40:16,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:40:16,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-08 14:40:16,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-08 14:40:16,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:40:16,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-08 14:40:16,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-08 14:40:16,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:40:16,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-08 14:40:16,722 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:40:16,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:40:16,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:40:16,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 14:40:16,736 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-12-08 14:40:50,927 WARN L180 SmtUtils]: Spent 938.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-08 14:41:15,900 WARN L180 SmtUtils]: Spent 945.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-08 14:41:25,880 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-08 14:41:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:41:25,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:41:25,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-12-08 14:41:25,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 14:41:25,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2018-12-08 14:41:25,995 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-12-08 14:41:27,985 WARN L180 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-12-08 14:41:29,835 WARN L180 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-12-08 14:41:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:29,875 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-12-08 14:41:29,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 14:41:29,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-12-08 14:41:29,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 14:41:29,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-12-08 14:41:29,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-08 14:41:29,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-08 14:41:29,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-12-08 14:41:29,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 14:41:29,878 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-12-08 14:41:29,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-12-08 14:41:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-12-08 14:41:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-08 14:41:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-08 14:41:29,880 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-08 14:41:29,880 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-08 14:41:29,880 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 14:41:29,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-12-08 14:41:29,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 14:41:29,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:41:29,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:41:29,881 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:29,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 14:41:29,881 INFO L794 eck$LassoCheckResult]: Stem: 534#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 533#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 527#L565 assume !(main_~length1~0 < 1); 528#L565-2 assume !(main_~length2~0 < 1); 526#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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 + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 519#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 520#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 538#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 531#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 532#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 541#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 524#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 525#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 521#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 523#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 535#L555-5 [2018-12-08 14:41:29,881 INFO L796 eck$LassoCheckResult]: Loop: 535#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 529#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 530#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 535#L555-5 [2018-12-08 14:41:29,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:29,881 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-08 14:41:29,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:41:29,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:41:29,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:29,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:29,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:41:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:41:29,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:29,894 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-08 14:41:29,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:41:29,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:41:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:29,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:41:29,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:41:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:41:29,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:29,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-08 14:41:29,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:41:29,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:41:29,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:29,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:41:29,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:41:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:41:30,325 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 134 [2018-12-08 14:41:30,894 WARN L180 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2018-12-08 14:41:30,897 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 14:41:30,897 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 14:41:30,897 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 14:41:30,897 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 14:41:30,897 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 14:41:30,897 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:41:30,897 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 14:41:30,897 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 14:41:30,898 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-08 14:41:30,898 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 14:41:30,898 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 14:41:30,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:30,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:31,085 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 14:41:31,441 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2018-12-08 14:41:31,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:31,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-12-08 14:41:31,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:31,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-12-08 14:41:31,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:31,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:41:31,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-12-08 14:41:31,965 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 120 [2018-12-08 14:41:32,019 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 14:41:36,345 WARN L180 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 176 DAG size of output: 125 [2018-12-08 14:41:37,591 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2018-12-08 14:41:37,599 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 14:41:37,599 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 14:41:37,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:41:37,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:41:37,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:41:37,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:41:37,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,601 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-12-08 14:41:37,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:41:37,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:41:37,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:41:37,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:41:37,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:41:37,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:41:37,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,604 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-12-08 14:41:37,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:41:37,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:41:37,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:41:37,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:41:37,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:41:37,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:41:37,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:41:37,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,606 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-12-08 14:41:37,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:41:37,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:41:37,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:41:37,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,607 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-12-08 14:41:37,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:41:37,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:41:37,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:41:37,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:41:37,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:41:37,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:41:37,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,610 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-12-08 14:41:37,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:41:37,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:41:37,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,612 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-12-08 14:41:37,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:41:37,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:41:37,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:41:37,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:41:37,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:41:37,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:41:37,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:41:37,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:41:37,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:41:37,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:41:37,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,615 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-12-08 14:41:37,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:41:37,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:41:37,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:41:37,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:41:37,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:41:37,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:41:37,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:41:37,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:41:37,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:41:37,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,619 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-12-08 14:41:37,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:41:37,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:41:37,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,621 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-12-08 14:41:37,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,621 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:41:37,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,622 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:41:37,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:41:37,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,625 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-12-08 14:41:37,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:41:37,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:41:37,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:41:37,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:41:37,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:41:37,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:41:37,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:41:37,627 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2018-12-08 14:41:37,627 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-08 14:41:37,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:41:37,717 INFO L402 nArgumentSynthesizer]: We have 276 Motzkin's Theorem applications. [2018-12-08 14:41:37,717 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-08 14:41:39,520 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 14:41:41,858 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2018-12-08 14:41:41,858 INFO L444 ModelExtractionUtils]: 359 out of 378 variables were initially zero. Simplification set additionally 16 variables to zero. [2018-12-08 14:41:41,859 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 14:41:41,861 INFO L440 nArgumentSynthesizer]: Removed 12 redundant supporting invariants from a total of 12. [2018-12-08 14:41:41,862 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 14:41:41,862 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-12-08 14:41:41,945 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2018-12-08 14:41:41,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 14:41:41,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:41,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:41:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:41,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:41:41,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:41:41,977 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-12-08 14:41:41,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-08 14:41:41,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2018-12-08 14:41:41,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 14:41:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 14:41:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-08 14:41:41,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 14:41:41,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:41:41,992 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 14:41:42,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:42,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:41:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:42,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:41:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:41:42,022 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 14:41:42,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-08 14:41:42,033 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2018-12-08 14:41:42,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 14:41:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 14:41:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-08 14:41:42,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 14:41:42,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:41:42,033 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 14:41:42,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:42,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:41:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:42,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:41:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:41:42,112 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 14:41:42,112 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-08 14:41:42,123 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2018-12-08 14:41:42,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 14:41:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 14:41:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-12-08 14:41:42,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 14:41:42,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:41:42,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-08 14:41:42,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:41:42,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-08 14:41:42,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:41:42,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-12-08 14:41:42,126 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 14:41:42,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-12-08 14:41:42,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 14:41:42,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 14:41:42,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 14:41:42,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 14:41:42,127 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:41:42,127 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:41:42,127 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:41:42,127 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 14:41:42,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 14:41:42,127 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 14:41:42,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 14:41:42,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 02:41:42 BoogieIcfgContainer [2018-12-08 14:41:42,131 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 14:41:42,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 14:41:42,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 14:41:42,132 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 14:41:42,132 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:40:13" (3/4) ... [2018-12-08 14:41:42,134 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 14:41:42,134 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 14:41:42,135 INFO L168 Benchmark]: Toolchain (without parser) took 89117.50 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 644.3 MB). Free memory was 957.1 MB in the beginning and 1.4 GB in the end (delta: -485.9 MB). Peak memory consumption was 158.4 MB. Max. memory is 11.5 GB. [2018-12-08 14:41:42,135 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:41:42,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-08 14:41:42,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.76 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-12-08 14:41:42,136 INFO L168 Benchmark]: Boogie Preprocessor took 17.91 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-12-08 14:41:42,136 INFO L168 Benchmark]: RCFGBuilder took 190.73 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-12-08 14:41:42,136 INFO L168 Benchmark]: BuchiAutomizer took 88612.47 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 505.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -346.8 MB). Peak memory consumption was 159.1 MB. Max. memory is 11.5 GB. [2018-12-08 14:41:42,137 INFO L168 Benchmark]: Witness Printer took 2.62 ms. Allocated memory is still 1.7 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:41:42,139 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.76 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. * Boogie Preprocessor took 17.91 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 190.73 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 88612.47 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 505.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -346.8 MB). Peak memory consumption was 159.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.62 ms. Allocated memory is still 1.7 GB. Free memory is still 1.4 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 88.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 84.2s. Construction of modules took 0.1s. Büchi inclusion checks took 4.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 115 SDslu, 95 SDs, 0 SdLazy, 151 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital366 mio100 ax105 hnf99 lsp87 ukn71 mio100 lsp69 div125 bol100 ite100 ukn100 eq169 hnf83 smp79 dnf1846 smp25 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 4235ms VariablesStem: 30 VariablesLoop: 19 DisjunctsStem: 16 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 276 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...