./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/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 c10d45b5c95e322c3a9476f6a89ce233987fcc3d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:51:38,397 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:51:38,399 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:51:38,406 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:51:38,406 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:51:38,407 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:51:38,408 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:51:38,409 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:51:38,410 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:51:38,410 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:51:38,411 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:51:38,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:51:38,412 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:51:38,413 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:51:38,413 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:51:38,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:51:38,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:51:38,415 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:51:38,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:51:38,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:51:38,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:51:38,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:51:38,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:51:38,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:51:38,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:51:38,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:51:38,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:51:38,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:51:38,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:51:38,424 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:51:38,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:51:38,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:51:38,425 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:51:38,425 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:51:38,426 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:51:38,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:51:38,426 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:51:38,435 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:51:38,436 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:51:38,437 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:51:38,437 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:51:38,437 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:51:38,437 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:51:38,437 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:51:38,437 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:51:38,437 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:51:38,438 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:51:38,438 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:51:38,438 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:51:38,438 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:51:38,438 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:51:38,438 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:51:38,438 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:51:38,438 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:51:38,439 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:51:38,439 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:51:38,439 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:51:38,439 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:51:38,439 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:51:38,439 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:51:38,439 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:51:38,440 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:51:38,440 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:51:38,440 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:51:38,441 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:51:38,441 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_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/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 -> c10d45b5c95e322c3a9476f6a89ce233987fcc3d [2018-11-10 07:51:38,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:51:38,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:51:38,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:51:38,476 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:51:38,476 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:51:38,477 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-11-10 07:51:38,517 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/bin-2019/uautomizer/data/1096be3b9/b2de4919a89d4a1bb3b61402570f8975/FLAG895ae769c [2018-11-10 07:51:38,850 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:51:38,851 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-11-10 07:51:38,859 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/bin-2019/uautomizer/data/1096be3b9/b2de4919a89d4a1bb3b61402570f8975/FLAG895ae769c [2018-11-10 07:51:38,871 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/bin-2019/uautomizer/data/1096be3b9/b2de4919a89d4a1bb3b61402570f8975 [2018-11-10 07:51:38,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:51:38,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:51:38,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:51:38,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:51:38,879 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:51:38,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:38" (1/1) ... [2018-11-10 07:51:38,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff1ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:38, skipping insertion in model container [2018-11-10 07:51:38,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:38" (1/1) ... [2018-11-10 07:51:38,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:51:38,919 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:51:39,107 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:51:39,115 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:51:39,144 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:51:39,167 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:51:39,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:39 WrapperNode [2018-11-10 07:51:39,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:51:39,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:51:39,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:51:39,169 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:51:39,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:39" (1/1) ... [2018-11-10 07:51:39,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:39" (1/1) ... [2018-11-10 07:51:39,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:51:39,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:51:39,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:51:39,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:51:39,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:39" (1/1) ... [2018-11-10 07:51:39,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:39" (1/1) ... [2018-11-10 07:51:39,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:39" (1/1) ... [2018-11-10 07:51:39,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:39" (1/1) ... [2018-11-10 07:51:39,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:39" (1/1) ... [2018-11-10 07:51:39,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:39" (1/1) ... [2018-11-10 07:51:39,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:39" (1/1) ... [2018-11-10 07:51:39,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:51:39,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:51:39,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:51:39,264 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:51:39,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:51:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:51:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:51:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:51:39,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:51:39,449 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:51:39,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:39 BoogieIcfgContainer [2018-11-10 07:51:39,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:51:39,450 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:51:39,450 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:51:39,452 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:51:39,453 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:51:39,453 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:51:38" (1/3) ... [2018-11-10 07:51:39,454 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21cfe0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:51:39, skipping insertion in model container [2018-11-10 07:51:39,454 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:51:39,454 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:39" (2/3) ... [2018-11-10 07:51:39,454 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21cfe0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:51:39, skipping insertion in model container [2018-11-10 07:51:39,454 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:51:39,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:39" (3/3) ... [2018-11-10 07:51:39,456 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-termination.c.i [2018-11-10 07:51:39,499 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:51:39,500 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:51:39,500 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:51:39,500 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:51:39,500 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:51:39,500 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:51:39,500 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:51:39,500 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:51:39,500 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:51:39,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 07:51:39,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:51:39,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:51:39,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:51:39,530 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:39,530 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:51:39,530 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:51:39,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-10 07:51:39,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:51:39,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:51:39,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:51:39,532 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:39,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:51:39,537 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 15#L562true assume !(main_~length1~0 < 1); 22#L562-2true assume !(main_~length2~0 < 1); 11#L565-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 25#L570true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 5#L570-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 21#L571true assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 6#L553-6true [2018-11-10 07:51:39,537 INFO L795 eck$LassoCheckResult]: Loop: 6#L553-6true assume true; 16#L552-1true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 19#L552-2true SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 24#L552-3true cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 3#L552-4true assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 4#L553-5true assume !true; 6#L553-6true [2018-11-10 07:51:39,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:39,541 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 07:51:39,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:39,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:39,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:39,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:39,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:39,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:39,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1540280279, now seen corresponding path program 1 times [2018-11-10 07:51:39,638 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:39,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:39,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:39,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:39,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:39,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:51:39,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-10 07:51:39,668 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:51:39,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:51:39,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:51:39,678 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-10 07:51:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:51:39,683 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-10 07:51:39,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:51:39,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2018-11-10 07:51:39,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:51:39,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 21 transitions. [2018-11-10 07:51:39,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 07:51:39,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 07:51:39,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-10 07:51:39,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:51:39,689 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-10 07:51:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-10 07:51:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-10 07:51:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 07:51:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-10 07:51:39,706 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-10 07:51:39,706 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-10 07:51:39,706 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:51:39,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-10 07:51:39,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 07:51:39,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:51:39,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:51:39,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:39,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:39,708 INFO L793 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 63#L562 assume !(main_~length1~0 < 1); 68#L562-2 assume !(main_~length2~0 < 1); 64#L565-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 65#L570 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 57#L570-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 58#L571 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 59#L553-6 [2018-11-10 07:51:39,708 INFO L795 eck$LassoCheckResult]: Loop: 59#L553-6 assume true; 60#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 69#L552-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 71#L552-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 54#L552-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 55#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 56#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 67#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 70#L553-3 assume !(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 59#L553-6 [2018-11-10 07:51:39,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:39,708 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 07:51:39,708 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:39,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:39,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:39,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:39,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:39,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash -941209857, now seen corresponding path program 1 times [2018-11-10 07:51:39,737 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:39,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:39,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:51:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:39,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:39,754 INFO L82 PathProgramCache]: Analyzing trace with hash -843635947, now seen corresponding path program 1 times [2018-11-10 07:51:39,754 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:39,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:39,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:39,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:39,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:40,116 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-10 07:51:40,205 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:51:40,205 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:51:40,205 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:51:40,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:51:40,206 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:51:40,206 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:51:40,206 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:51:40,206 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:51:40,206 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 07:51:40,206 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:51:40,207 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:51:40,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,493 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-11-10 07:51:40,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,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-11-10 07:51:40,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,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-11-10 07:51:40,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:40,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:41,035 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:51:41,038 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:51:41,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-11-10 07:51:41,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:41,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:41,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:41,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:41,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:41,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:41,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:41,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:41,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:41,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:41,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:41,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:41,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:41,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:41,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:41,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:41,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:41,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:41,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:41,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:41,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:41,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:41,058 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:41,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:41,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:41,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:41,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:41,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:41,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:41,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:41,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:41,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:41,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:41,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:41,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:41,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:41,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:41,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:41,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:41,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:41,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:41,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:41,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:41,080 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:41,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:41,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:41,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:41,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:41,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-11-10 07:51:41,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:41,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:41,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:41,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:41,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:41,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:41,139 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:51:41,158 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 07:51:41,158 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:51:41,160 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:51:41,161 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:51:41,161 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:51:41,161 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrpbrk_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrpbrk_~s1.offset Supporting invariants [] [2018-11-10 07:51:41,202 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 07:51:41,206 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:51:41,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:41,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:41,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:41,315 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 07:51:41,315 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-10 07:51:41,390 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 29 states and 34 transitions. Complement of second has 7 states. [2018-11-10 07:51:41,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:51:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 07:51:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-10 07:51:41,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 9 letters. [2018-11-10 07:51:41,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:41,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 17 letters. Loop has 9 letters. [2018-11-10 07:51:41,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:41,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 18 letters. [2018-11-10 07:51:41,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:41,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2018-11-10 07:51:41,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:51:41,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 29 transitions. [2018-11-10 07:51:41,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 07:51:41,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 07:51:41,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2018-11-10 07:51:41,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:51:41,396 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 07:51:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2018-11-10 07:51:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 07:51:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 07:51:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-10 07:51:41,398 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 07:51:41,398 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 07:51:41,398 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:51:41,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-11-10 07:51:41,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:51:41,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:51:41,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:51:41,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:41,400 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:51:41,400 INFO L793 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 233#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 234#L562 assume !(main_~length1~0 < 1); 240#L562-2 assume !(main_~length2~0 < 1); 235#L565-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 236#L570 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 226#L570-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 227#L571 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 228#L553-6 assume true; 229#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 241#L552-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 244#L552-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 220#L552-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 221#L553-5 [2018-11-10 07:51:41,400 INFO L795 eck$LassoCheckResult]: Loop: 221#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 224#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 238#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 242#L553-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 231#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 221#L553-5 [2018-11-10 07:51:41,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:41,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1016364753, now seen corresponding path program 1 times [2018-11-10 07:51:41,400 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:41,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:41,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:41,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:41,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:41,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:41,419 INFO L82 PathProgramCache]: Analyzing trace with hash 62061768, now seen corresponding path program 1 times [2018-11-10 07:51:41,419 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:41,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:41,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:41,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:41,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:41,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:41,426 INFO L82 PathProgramCache]: Analyzing trace with hash -382910472, now seen corresponding path program 1 times [2018-11-10 07:51:41,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:41,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:41,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:41,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:41,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:41,711 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2018-11-10 07:51:41,788 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:51:41,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:51:41,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:51:41,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:51:41,788 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:51:41,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:51:41,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:51:41,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:51:41,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 07:51:41,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:51:41,788 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:51:41,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:41,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:41,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:41,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:41,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:41,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:41,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,000 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2018-11-10 07:51:42,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:42,456 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:51:42,456 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:51:42,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:42,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:42,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:42,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:42,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:42,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:42,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:42,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:42,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:42,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:42,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:42,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:42,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:42,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:42,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:42,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:42,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:42,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,471 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:51:42,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,473 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:51:42,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:42,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:42,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:42,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:42,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:42,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:42,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:42,495 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:42,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:42,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:42,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:42,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,507 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:51:42,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,508 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:51:42,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:42,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:42,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:42,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:42,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:42,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,520 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:51:42,520 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-10 07:51:42,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,530 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-11-10 07:51:42,530 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-10 07:51:42,559 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:42,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:51:42,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:42,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:42,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:42,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:42,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:42,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:42,576 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:51:42,586 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 07:51:42,586 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 07:51:42,587 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:51:42,587 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:51:42,588 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:51:42,588 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-11-10 07:51:42,622 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 07:51:42,624 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:51:42,624 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:51:42,624 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 07:51:42,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:42,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:42,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:42,710 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 07:51:42,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 07:51:42,767 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 63 states and 71 transitions. Complement of second has 9 states. [2018-11-10 07:51:42,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:51:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 07:51:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-10 07:51:42,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-10 07:51:42,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:42,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-10 07:51:42,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:42,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 13 letters. Loop has 10 letters. [2018-11-10 07:51:42,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:42,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 71 transitions. [2018-11-10 07:51:42,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:51:42,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 42 states and 48 transitions. [2018-11-10 07:51:42,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 07:51:42,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 07:51:42,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2018-11-10 07:51:42,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:51:42,771 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-10 07:51:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2018-11-10 07:51:42,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2018-11-10 07:51:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 07:51:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-10 07:51:42,773 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 07:51:42,774 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 07:51:42,774 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:51:42,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-11-10 07:51:42,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:51:42,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:51:42,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:51:42,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:42,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:51:42,776 INFO L793 eck$LassoCheckResult]: Stem: 477#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 473#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 474#L562 assume !(main_~length1~0 < 1); 480#L562-2 assume !(main_~length2~0 < 1); 475#L565-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 476#L570 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 465#L570-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 466#L571 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 467#L553-6 assume true; 468#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 483#L552-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 485#L552-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 486#L552-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 492#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 491#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 489#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 484#L553-3 assume !(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 469#L553-6 assume true; 470#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 488#L552-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 487#L552-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 459#L552-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 460#L553-5 [2018-11-10 07:51:42,776 INFO L795 eck$LassoCheckResult]: Loop: 460#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 463#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 478#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 481#L553-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 471#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 460#L553-5 [2018-11-10 07:51:42,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:42,776 INFO L82 PathProgramCache]: Analyzing trace with hash 190697767, now seen corresponding path program 2 times [2018-11-10 07:51:42,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:42,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:42,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:42,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:42,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:42,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:42,795 INFO L82 PathProgramCache]: Analyzing trace with hash 62061768, now seen corresponding path program 2 times [2018-11-10 07:51:42,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:42,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:42,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:42,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:51:42,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:42,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:42,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1881666402, now seen corresponding path program 1 times [2018-11-10 07:51:42,800 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:42,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:42,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:51:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:42,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:51:42,887 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_961a3a33-b4c6-4ba2-84be-440c39b9cfe8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:51:42,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:42,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:42,965 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-10 07:51:42,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 07:51:42,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:42,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:42,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 07:51:42,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-11-10 07:51:45,811 WARN L179 SmtUtils]: Spent 945.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 07:51:48,360 WARN L179 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 07:51:51,447 WARN L179 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 07:51:51,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 07:51:51,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-11-10 07:51:51,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:51,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:51,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:51,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-11-10 07:51:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:51,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:51:51,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-11-10 07:51:51,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 07:51:51,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=327, Unknown=4, NotChecked=0, Total=380 [2018-11-10 07:51:51,514 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-11-10 07:51:55,963 WARN L179 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-11-10 07:51:57,448 WARN L179 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-11-10 07:52:21,506 WARN L179 SmtUtils]: Spent 24.03 s on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-11-10 07:52:22,917 WARN L179 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-11-10 07:52:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:52:22,981 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-10 07:52:22,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 07:52:22,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2018-11-10 07:52:22,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:52:22,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 59 states and 65 transitions. [2018-11-10 07:52:22,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 07:52:22,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 07:52:22,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 65 transitions. [2018-11-10 07:52:22,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:52:22,988 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-11-10 07:52:22,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 65 transitions. [2018-11-10 07:52:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2018-11-10 07:52:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 07:52:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-10 07:52:22,990 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-10 07:52:22,990 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-10 07:52:22,990 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:52:22,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 47 transitions. [2018-11-10 07:52:22,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:52:22,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:52:22,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:52:22,991 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:52:22,992 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:52:22,992 INFO L793 eck$LassoCheckResult]: Stem: 721#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 717#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 718#L562 assume !(main_~length1~0 < 1); 724#L562-2 assume !(main_~length2~0 < 1); 719#L565-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 720#L570 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L570 709#L570-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L570-1 710#L571 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 711#L553-6 assume true; 712#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 725#L552-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 729#L552-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 707#L552-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 708#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 736#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 727#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 728#L553-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 716#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 704#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 705#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 723#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 733#L553-3 assume !(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 713#L553-6 assume true; 714#L552-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 732#L552-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L552-2 730#L552-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 706#L552-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 702#L553-5 [2018-11-10 07:52:22,992 INFO L795 eck$LassoCheckResult]: Loop: 702#L553-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 703#L553-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L553-1 722#L553-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 726#L553-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 715#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 702#L553-5 [2018-11-10 07:52:22,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:22,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1623299104, now seen corresponding path program 2 times [2018-11-10 07:52:22,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:22,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:22,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:22,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:52:22,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:52:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:52:23,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:23,011 INFO L82 PathProgramCache]: Analyzing trace with hash 62061768, now seen corresponding path program 3 times [2018-11-10 07:52:23,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:23,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:23,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:23,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:52:23,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:52:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:52:23,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:23,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1313350729, now seen corresponding path program 3 times [2018-11-10 07:52:23,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:23,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:23,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:23,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:52:23,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:52:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:52:23,596 WARN L179 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 170 [2018-11-10 07:52:23,715 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-10 07:52:23,717 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:52:23,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:52:23,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:52:23,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:52:23,717 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:52:23,717 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:52:23,717 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:52:23,717 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:52:23,717 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-10 07:52:23,717 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:52:23,718 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:52:23,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:23,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:24,116 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2018-11-10 07:52:24,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:52:24,862 WARN L179 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-10 07:52:24,891 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:52:24,891 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:52:24,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:52:24,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:52:24,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:52:24,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:52:24,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:52:24,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:52:24,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:52:24,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:52:24,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:52:24,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:52:24,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:52:24,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:52:24,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,939 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:52:24,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:52:24,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:52:24,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:52:24,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:52:24,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:52:24,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:52:24,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:52:24,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:52:24,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:52:24,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:52:24,971 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:52:24,983 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 07:52:24,983 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 07:52:24,984 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:52:24,984 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:52:24,985 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:52:24,985 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-11-10 07:52:25,106 INFO L297 tatePredicateManager]: 31 out of 32 supporting invariants were superfluous and have been removed [2018-11-10 07:52:25,107 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:52:25,108 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:52:25,108 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 07:52:25,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:25,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:52:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:25,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:52:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:25,196 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 07:52:25,196 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-10 07:52:25,251 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 60 states and 67 transitions. Complement of second has 9 states. [2018-11-10 07:52:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:52:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 07:52:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-10 07:52:25,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 27 letters. Loop has 5 letters. [2018-11-10 07:52:25,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:52:25,252 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:52:25,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:25,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:52:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:25,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:52:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:25,325 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 07:52:25,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-10 07:52:25,398 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 61 states and 68 transitions. Complement of second has 11 states. [2018-11-10 07:52:25,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 07:52:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 07:52:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-10 07:52:25,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 27 letters. Loop has 5 letters. [2018-11-10 07:52:25,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:52:25,399 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:52:25,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:25,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:52:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:25,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:52:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:25,478 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 07:52:25,478 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-10 07:52:25,522 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 66 states and 74 transitions. Complement of second has 8 states. [2018-11-10 07:52:25,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:52:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 07:52:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-10 07:52:25,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 27 letters. Loop has 5 letters. [2018-11-10 07:52:25,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:52:25,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-10 07:52:25,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:52:25,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-10 07:52:25,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:52:25,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2018-11-10 07:52:25,525 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:52:25,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-11-10 07:52:25,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:52:25,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:52:25,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:52:25,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:52:25,526 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:52:25,526 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:52:25,526 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:52:25,526 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:52:25,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:52:25,526 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:52:25,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:52:25,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:52:25 BoogieIcfgContainer [2018-11-10 07:52:25,530 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:52:25,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:52:25,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:52:25,530 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:52:25,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:39" (3/4) ... [2018-11-10 07:52:25,534 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:52:25,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:52:25,534 INFO L168 Benchmark]: Toolchain (without parser) took 46660.07 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.1 MB). Free memory was 956.6 MB in the beginning and 1.3 GB in the end (delta: -364.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:52:25,535 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:52:25,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.50 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:52:25,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 935.1 MB in the beginning and 1.2 GB in the end (delta: -224.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:52:25,536 INFO L168 Benchmark]: Boogie Preprocessor took 19.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:52:25,536 INFO L168 Benchmark]: RCFGBuilder took 185.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:52:25,537 INFO L168 Benchmark]: BuchiAutomizer took 46079.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 226.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -183.2 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:52:25,537 INFO L168 Benchmark]: Witness Printer took 3.63 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:52:25,539 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.50 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 935.1 MB in the beginning and 1.2 GB in the end (delta: -224.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 185.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 46079.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 226.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -183.2 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.63 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * 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 #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * 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 * s1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * scanp and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * scanp and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 46.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 13.7s. Construction of modules took 0.2s. Büchi inclusion checks took 32.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 146 SDtfs, 193 SDslu, 343 SDs, 0 SdLazy, 345 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax107 hnf99 lsp89 ukn98 mio100 lsp40 div100 bol100 ite100 ukn100 eq188 hnf87 smp91 dnf236 smp90 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 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...