./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/build_fullname_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/build_fullname_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/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 d5a9d2464f90cb604e81a75f4f55e926d182d9fa ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:29:33,356 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:29:33,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:29:33,364 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:29:33,364 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:29:33,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:29:33,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:29:33,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:29:33,368 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:29:33,368 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:29:33,369 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:29:33,369 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:29:33,370 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:29:33,371 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:29:33,372 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:29:33,372 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:29:33,373 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:29:33,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:29:33,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:29:33,376 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:29:33,377 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:29:33,378 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:29:33,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:29:33,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:29:33,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:29:33,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:29:33,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:29:33,382 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:29:33,383 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:29:33,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:29:33,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:29:33,384 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:29:33,384 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:29:33,384 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:29:33,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:29:33,386 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:29:33,386 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:29:33,397 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:29:33,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:29:33,398 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:29:33,398 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:29:33,398 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:29:33,398 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:29:33,398 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:29:33,399 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:29:33,399 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:29:33,399 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:29:33,399 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:29:33,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:29:33,399 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:29:33,399 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:29:33,399 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:29:33,399 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:29:33,400 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:29:33,400 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:29:33,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:29:33,400 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:29:33,400 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:29:33,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:29:33,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:29:33,400 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:29:33,401 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:29:33,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:29:33,401 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:29:33,401 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:29:33,401 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:29:33,401 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_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/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 -> d5a9d2464f90cb604e81a75f4f55e926d182d9fa [2018-11-23 15:29:33,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:29:33,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:29:33,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:29:33,434 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:29:33,434 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:29:33,434 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/build_fullname_true-termination.c.i [2018-11-23 15:29:33,475 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/bin-2019/uautomizer/data/5e1885b44/b6fe4a37e5b640fdba2443a53c8ea4f2/FLAGc0032f7c0 [2018-11-23 15:29:33,821 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:29:33,822 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/sv-benchmarks/c/termination-libowfat/build_fullname_true-termination.c.i [2018-11-23 15:29:33,832 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/bin-2019/uautomizer/data/5e1885b44/b6fe4a37e5b640fdba2443a53c8ea4f2/FLAGc0032f7c0 [2018-11-23 15:29:33,841 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/bin-2019/uautomizer/data/5e1885b44/b6fe4a37e5b640fdba2443a53c8ea4f2 [2018-11-23 15:29:33,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:29:33,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:29:33,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:29:33,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:29:33,847 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:29:33,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:29:33" (1/1) ... [2018-11-23 15:29:33,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a78139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:33, skipping insertion in model container [2018-11-23 15:29:33,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:29:33" (1/1) ... [2018-11-23 15:29:33,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:29:33,883 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:29:34,083 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:29:34,090 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:29:34,174 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:29:34,199 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:29:34,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:34 WrapperNode [2018-11-23 15:29:34,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:29:34,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:29:34,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:29:34,201 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:29:34,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:34" (1/1) ... [2018-11-23 15:29:34,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:34" (1/1) ... [2018-11-23 15:29:34,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:29:34,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:29:34,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:29:34,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:29:34,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:34" (1/1) ... [2018-11-23 15:29:34,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:34" (1/1) ... [2018-11-23 15:29:34,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:34" (1/1) ... [2018-11-23 15:29:34,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:34" (1/1) ... [2018-11-23 15:29:34,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:34" (1/1) ... [2018-11-23 15:29:34,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:34" (1/1) ... [2018-11-23 15:29:34,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:34" (1/1) ... [2018-11-23 15:29:34,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:29:34,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:29:34,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:29:34,258 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:29:34,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3aaf9bc-d1fc-4a0f-8aa1-337e66c17212/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-23 15:29:34,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:29:34,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:29:34,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:29:34,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:29:34,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:29:34,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:29:34,527 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:29:34,527 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-23 15:29:34,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:29:34 BoogieIcfgContainer [2018-11-23 15:29:34,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:29:34,528 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:29:34,529 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:29:34,532 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:29:34,533 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:29:34,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:29:33" (1/3) ... [2018-11-23 15:29:34,534 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5901fee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:29:34, skipping insertion in model container [2018-11-23 15:29:34,534 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:29:34,534 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:29:34" (2/3) ... [2018-11-23 15:29:34,534 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5901fee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:29:34, skipping insertion in model container [2018-11-23 15:29:34,535 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:29:34,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:29:34" (3/3) ... [2018-11-23 15:29:34,536 INFO L375 chiAutomizerObserver]: Analyzing ICFG build_fullname_true-termination.c.i [2018-11-23 15:29:34,570 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:29:34,571 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:29:34,571 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:29:34,571 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:29:34,571 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:29:34,571 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:29:34,571 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:29:34,571 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:29:34,572 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:29:34,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-23 15:29:34,596 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-23 15:29:34,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:34,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:34,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:29:34,601 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:29:34,601 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:29:34,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-23 15:29:34,602 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-23 15:29:34,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:34,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:34,603 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:29:34,603 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:29:34,608 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 9#L532true assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 20#L534true assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 10#L521true assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 13#L521-2true assume build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;call write~int(47, build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 1);build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;havoc build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset; 14#L523-4true strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~filename.base, build_fullname_~filename.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 24#L508-8true [2018-11-23 15:29:34,608 INFO L796 eck$LassoCheckResult]: Loop: 24#L508-8true strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 7#L508-6true assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 24#L508-8true [2018-11-23 15:29:34,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:34,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905919, now seen corresponding path program 1 times [2018-11-23 15:29:34,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:34,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:34,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:34,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:34,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:34,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:34,729 INFO L82 PathProgramCache]: Analyzing trace with hash 3590, now seen corresponding path program 1 times [2018-11-23 15:29:34,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:34,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:34,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:34,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:34,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:34,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:34,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1269803204, now seen corresponding path program 1 times [2018-11-23 15:29:34,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:34,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:34,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:35,481 WARN L180 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 148 [2018-11-23 15:29:35,733 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-23 15:29:35,743 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:29:35,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:29:35,745 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:29:35,745 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:29:35,745 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:29:35,745 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:29:35,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:29:35,745 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:29:35,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration1_Lasso [2018-11-23 15:29:35,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:29:35,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:29:35,763 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-23 15:29:35,767 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-23 15:29:35,768 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-23 15:29:35,771 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-23 15:29:35,773 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-23 15:29:35,774 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-23 15:29:35,775 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-23 15:29:35,776 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-23 15:29:35,778 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-23 15:29:35,786 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-23 15:29:35,788 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-23 15:29:35,789 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-23 15:29:35,791 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-23 15:29:35,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-23 15:29:35,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:35,795 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-23 15:29:35,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-23 15:29:35,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-23 15:29:35,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-23 15:29:35,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-23 15:29:35,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-23 15:29:35,809 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-23 15:29:36,278 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 116 [2018-11-23 15:29:36,377 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-23 15:29:36,378 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-23 15:29:36,379 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-23 15:29:36,380 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-23 15:29:36,381 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-23 15:29:36,381 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-23 15:29:36,383 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-23 15:29:36,847 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:29:36,852 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:29:36,853 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-23 15:29:36,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,859 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-23 15:29:36,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,862 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-23 15:29:36,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:36,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:36,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,868 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-23 15:29:36,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,872 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-23 15:29:36,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,874 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-23 15:29:36,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,876 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-23 15:29:36,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,878 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-23 15:29:36,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,880 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-23 15:29:36,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,882 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-23 15:29:36,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,884 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-23 15:29:36,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,886 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-23 15:29:36,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,888 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-23 15:29:36,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,890 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-23 15:29:36,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,892 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-23 15:29:36,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,895 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-23 15:29:36,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,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-23 15:29:36,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,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-23 15:29:36,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,901 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-23 15:29:36,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:36,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,905 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-23 15:29:36,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:36,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:36,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,908 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-23 15:29:36,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:36,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:36,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,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-23 15:29:36,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,919 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:29:36,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,922 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:29:36,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:36,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,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-23 15:29:36,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:36,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:36,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,945 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-23 15:29:36,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,946 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 15:29:36,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,947 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:29:36,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:36,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,951 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-23 15:29:36,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:36,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:36,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:36,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:36,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:36,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,960 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-23 15:29:36,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,961 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:29:36,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,963 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:29:36,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:36,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:36,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,976 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:29:36,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,977 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:29:36,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:36,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,985 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-23 15:29:36,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:36,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:36,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:36,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:36,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:36,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:36,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:36,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:36,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:36,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:36,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:36,998 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-23 15:29:36,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:36,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:36,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:36,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:37,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:37,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:37,060 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:29:37,102 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 15:29:37,102 INFO L444 ModelExtractionUtils]: 70 out of 79 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 15:29:37,104 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:29:37,105 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:29:37,106 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:29:37,107 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcpy_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1) = -1*ULTIMATE.start_strcpy_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1 Supporting invariants [] [2018-11-23 15:29:37,234 INFO L297 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2018-11-23 15:29:37,241 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:29:37,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:37,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:37,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:37,353 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-23 15:29:37,363 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 15:29:37,363 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 4 states. [2018-11-23 15:29:37,433 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 4 states. Result 59 states and 81 transitions. Complement of second has 8 states. [2018-11-23 15:29:37,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-23 15:29:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:29:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 15:29:37,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 63 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 15:29:37,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:37,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 63 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 15:29:37,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:37,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 63 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-23 15:29:37,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:37,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 81 transitions. [2018-11-23 15:29:37,441 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-23 15:29:37,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 22 states and 27 transitions. [2018-11-23 15:29:37,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-23 15:29:37,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 15:29:37,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-23 15:29:37,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:29:37,445 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 15:29:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-23 15:29:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 15:29:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 15:29:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-23 15:29:37,462 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 15:29:37,462 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 15:29:37,462 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:29:37,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-11-23 15:29:37,463 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-23 15:29:37,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:37,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:37,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:29:37,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:29:37,463 INFO L794 eck$LassoCheckResult]: Stem: 308#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 305#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 306#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 301#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 302#L521 assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 307#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 303#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 304#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 290#L508-3 [2018-11-23 15:29:37,463 INFO L796 eck$LassoCheckResult]: Loop: 290#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 291#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 290#L508-3 [2018-11-23 15:29:37,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:37,463 INFO L82 PathProgramCache]: Analyzing trace with hash 179509076, now seen corresponding path program 1 times [2018-11-23 15:29:37,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:37,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:37,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:37,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:37,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:29:37,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:29:37,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:29:37,528 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:29:37,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:37,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 1 times [2018-11-23 15:29:37,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:37,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:37,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:37,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:37,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:37,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:29:37,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:29:37,634 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-23 15:29:37,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:29:37,677 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 15:29:37,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:29:37,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2018-11-23 15:29:37,679 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-23 15:29:37,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 30 transitions. [2018-11-23 15:29:37,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-23 15:29:37,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-23 15:29:37,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-23 15:29:37,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:29:37,680 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-23 15:29:37,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-23 15:29:37,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-11-23 15:29:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 15:29:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-23 15:29:37,682 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 15:29:37,682 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 15:29:37,682 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:29:37,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-23 15:29:37,684 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-23 15:29:37,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:37,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:37,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:29:37,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:29:37,685 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 361#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 360#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 354#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 355#L521 assume !build_fullname_#t~short10; 362#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 365#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 359#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 345#L508-3 [2018-11-23 15:29:37,685 INFO L796 eck$LassoCheckResult]: Loop: 345#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 346#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 345#L508-3 [2018-11-23 15:29:37,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:37,685 INFO L82 PathProgramCache]: Analyzing trace with hash 179568658, now seen corresponding path program 1 times [2018-11-23 15:29:37,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:37,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:37,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:37,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 2 times [2018-11-23 15:29:37,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:37,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:37,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:37,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:37,712 INFO L82 PathProgramCache]: Analyzing trace with hash 766789687, now seen corresponding path program 1 times [2018-11-23 15:29:37,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:37,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:37,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:29:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:38,295 WARN L180 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 147 [2018-11-23 15:29:38,443 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-23 15:29:38,445 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:29:38,445 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:29:38,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:29:38,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:29:38,445 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:29:38,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:29:38,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:29:38,445 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:29:38,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration3_Lasso [2018-11-23 15:29:38,445 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:29:38,445 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:29:38,449 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-23 15:29:38,451 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-23 15:29:38,452 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-23 15:29:38,453 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-23 15:29:38,458 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-23 15:29:38,459 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-23 15:29:38,460 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-23 15:29:38,461 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-23 15:29:38,462 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-23 15:29:38,463 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-23 15:29:38,463 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-23 15:29:38,464 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-23 15:29:38,465 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-23 15:29:38,466 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-23 15:29:38,467 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-23 15:29:38,468 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-23 15:29:38,469 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-23 15:29:38,469 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-23 15:29:38,470 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-23 15:29:38,859 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 122 [2018-11-23 15:29:38,979 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2018-11-23 15:29:38,979 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-23 15:29:38,981 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-23 15:29:38,982 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-23 15:29:38,983 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-23 15:29:38,984 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-23 15:29:38,985 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-23 15:29:38,986 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-23 15:29:38,987 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-23 15:29:38,988 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-23 15:29:38,989 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-23 15:29:38,990 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-23 15:29:39,186 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-11-23 15:29:39,495 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:29:39,495 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:29:39,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-23 15:29:39,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,498 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-23 15:29:39,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,503 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-23 15:29:39,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:39,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:39,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,505 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-23 15:29:39,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,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-23 15:29:39,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,508 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-23 15:29:39,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,510 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-23 15:29:39,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,512 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-23 15:29:39,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,514 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-23 15:29:39,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,515 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-23 15:29:39,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,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-23 15:29:39,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,519 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-23 15:29:39,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,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-23 15:29:39,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,522 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-23 15:29:39,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,523 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-23 15:29:39,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,525 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-23 15:29:39,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,526 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-23 15:29:39,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,528 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-23 15:29:39,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:39,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:39,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:39,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,529 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-23 15:29:39,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:39,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:39,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,532 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-23 15:29:39,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,532 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:29:39,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,534 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:29:39,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:39,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,541 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-23 15:29:39,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,541 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:29:39,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,543 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:29:39,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:39,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:39,549 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-23 15:29:39,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:39,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:39,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:39,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:39,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:39,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:39,583 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:29:39,621 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 15:29:39,622 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 15:29:39,622 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:29:39,623 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:29:39,623 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:29:39,623 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcpy_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2) = -1*ULTIMATE.start_strcpy_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2 Supporting invariants [] [2018-11-23 15:29:39,746 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-11-23 15:29:39,747 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:29:39,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:39,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:39,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:39,834 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-23 15:29:39,834 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 15:29:39,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 15:29:39,867 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 32 states and 39 transitions. Complement of second has 6 states. [2018-11-23 15:29:39,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 15:29:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:29:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-23 15:29:39,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 15:29:39,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:39,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-23 15:29:39,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:39,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-23 15:29:39,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:39,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2018-11-23 15:29:39,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 15:29:39,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 23 states and 28 transitions. [2018-11-23 15:29:39,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 15:29:39,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-23 15:29:39,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-23 15:29:39,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:29:39,871 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-23 15:29:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-23 15:29:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 15:29:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 15:29:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-11-23 15:29:39,873 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-23 15:29:39,873 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-23 15:29:39,873 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:29:39,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-11-23 15:29:39,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 15:29:39,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:39,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:39,874 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:29:39,874 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:29:39,877 INFO L794 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 610#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 611#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 604#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 605#L521 assume !build_fullname_#t~short10; 612#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 616#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 609#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 594#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 595#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 600#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 601#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 603#L514-2 [2018-11-23 15:29:39,877 INFO L796 eck$LassoCheckResult]: Loop: 603#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 597#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 599#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 603#L514-2 [2018-11-23 15:29:39,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:39,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1849486153, now seen corresponding path program 1 times [2018-11-23 15:29:39,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:39,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:39,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:39,934 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-23 15:29:39,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:29:39,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:29:39,935 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:29:39,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:39,935 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 1 times [2018-11-23 15:29:39,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:39,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:39,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:39,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:39,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:39,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:29:39,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:29:39,968 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-23 15:29:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:29:40,007 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 15:29:40,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:29:40,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-23 15:29:40,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 15:29:40,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 15:29:40,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 15:29:40,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 15:29:40,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-23 15:29:40,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:29:40,009 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 15:29:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-23 15:29:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 15:29:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 15:29:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 15:29:40,011 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 15:29:40,011 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 15:29:40,011 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:29:40,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-11-23 15:29:40,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 15:29:40,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:40,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:40,012 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:29:40,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:29:40,013 INFO L794 eck$LassoCheckResult]: Stem: 679#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 674#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 675#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 670#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 671#L521 assume !build_fullname_#t~short10; 676#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 682#L523 assume build_fullname_#t~short14; 673#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 681#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 660#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 664#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 665#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 667#L514-2 [2018-11-23 15:29:40,013 INFO L796 eck$LassoCheckResult]: Loop: 667#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 661#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 663#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 667#L514-2 [2018-11-23 15:29:40,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1906744455, now seen corresponding path program 1 times [2018-11-23 15:29:40,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:40,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:40,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:40,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:40,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:40,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:40,035 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 2 times [2018-11-23 15:29:40,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:40,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:40,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:40,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:40,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:40,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:40,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1413453764, now seen corresponding path program 1 times [2018-11-23 15:29:40,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:40,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:40,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:29:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:40,090 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-23 15:29:40,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:29:40,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:29:40,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:29:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:29:40,106 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-23 15:29:40,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:29:40,166 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 15:29:40,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:29:40,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2018-11-23 15:29:40,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 15:29:40,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 15:29:40,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-23 15:29:40,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-23 15:29:40,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-11-23 15:29:40,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:29:40,168 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 15:29:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-11-23 15:29:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-23 15:29:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 15:29:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-23 15:29:40,170 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 15:29:40,171 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 15:29:40,171 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 15:29:40,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2018-11-23 15:29:40,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 15:29:40,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:40,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:40,172 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:29:40,172 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:29:40,172 INFO L794 eck$LassoCheckResult]: Stem: 756#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 752#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 753#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 747#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 748#L521 assume !build_fullname_#t~short10; 754#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 760#L523 assume build_fullname_#t~short14; 750#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 735#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 736#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 737#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 738#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 742#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 743#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 757#L514-2 [2018-11-23 15:29:40,172 INFO L796 eck$LassoCheckResult]: Loop: 757#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 764#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 762#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 757#L514-2 [2018-11-23 15:29:40,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:40,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1571186846, now seen corresponding path program 1 times [2018-11-23 15:29:40,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:40,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:40,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:40,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:40,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:40,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:40,193 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 3 times [2018-11-23 15:29:40,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:40,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:40,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:40,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:40,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:40,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:40,197 INFO L82 PathProgramCache]: Analyzing trace with hash 673793151, now seen corresponding path program 1 times [2018-11-23 15:29:40,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:40,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:40,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:40,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:29:40,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:41,233 WARN L180 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 222 [2018-11-23 15:29:42,098 WARN L180 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 165 [2018-11-23 15:29:42,099 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:29:42,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:29:42,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:29:42,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:29:42,100 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:29:42,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:29:42,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:29:42,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:29:42,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration6_Lasso [2018-11-23 15:29:42,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:29:42,100 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:29:42,103 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-23 15:29:42,109 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-23 15:29:42,110 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-23 15:29:42,111 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-23 15:29:42,115 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-23 15:29:42,116 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-23 15:29:42,118 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-23 15:29:42,120 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-23 15:29:42,121 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-23 15:29:42,122 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-23 15:29:42,594 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 138 [2018-11-23 15:29:42,648 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-23 15:29:42,649 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-23 15:29:42,650 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-23 15:29:42,651 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-23 15:29:42,652 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-23 15:29:42,652 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-23 15:29:42,653 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-23 15:29:42,654 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-23 15:29:42,655 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-23 15:29:42,656 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-23 15:29:42,657 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-23 15:29:42,657 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-23 15:29:42,658 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-23 15:29:42,661 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-23 15:29:42,662 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-23 15:29:42,663 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-23 15:29:42,664 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-23 15:29:42,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:42,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:42,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:42,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:42,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:42,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:43,198 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:29:43,198 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:29:43,198 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-23 15:29:43,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:43,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:43,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:43,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,201 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-23 15:29:43,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:43,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:43,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:43,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,210 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-23 15:29:43,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:43,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:43,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:43,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,211 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-23 15:29:43,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:43,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:43,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:43,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,212 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-23 15:29:43,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:43,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:43,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:43,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,213 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-23 15:29:43,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:43,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:43,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:43,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,214 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-23 15:29:43,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:43,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:43,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:43,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,215 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-23 15:29:43,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:43,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:43,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:43,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,216 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-23 15:29:43,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:43,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:43,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:43,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,217 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-23 15:29:43,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:43,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:43,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,220 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-23 15:29:43,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:43,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:43,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,224 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-23 15:29:43,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:43,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:43,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,227 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-23 15:29:43,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:43,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:43,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:43,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,228 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-23 15:29:43,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,229 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:29:43,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,230 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:29:43,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:43,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,239 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-23 15:29:43,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,239 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 15:29:43,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,245 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-23 15:29:43,246 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 15:29:43,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,275 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-23 15:29:43,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:43,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:43,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,278 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-23 15:29:43,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:43,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:43,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,280 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-23 15:29:43,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:43,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:43,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,283 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-23 15:29:43,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:43,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:43,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:43,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:29:43,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:43,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:43,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:43,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:43,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:43,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:43,306 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:29:43,327 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 15:29:43,327 INFO L444 ModelExtractionUtils]: 71 out of 79 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 15:29:43,327 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:29:43,328 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:29:43,328 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:29:43,328 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strchr_~t.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3) = -1*ULTIMATE.start_strchr_~t.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3 Supporting invariants [] [2018-11-23 15:29:43,483 INFO L297 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2018-11-23 15:29:43,486 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:29:43,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:43,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:43,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:43,567 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-23 15:29:43,568 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 15:29:43,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 39 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-23 15:29:43,595 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 39 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 42 states and 54 transitions. Complement of second has 5 states. [2018-11-23 15:29:43,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 15:29:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:29:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-23 15:29:43,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 15:29:43,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:43,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-23 15:29:43,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:43,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 15:29:43,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:43,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2018-11-23 15:29:43,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:29:43,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 35 states and 43 transitions. [2018-11-23 15:29:43,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 15:29:43,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 15:29:43,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 43 transitions. [2018-11-23 15:29:43,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:29:43,598 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-23 15:29:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 43 transitions. [2018-11-23 15:29:43,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 15:29:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 15:29:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-23 15:29:43,600 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 15:29:43,600 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 15:29:43,600 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 15:29:43,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2018-11-23 15:29:43,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:29:43,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:29:43,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:29:43,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:29:43,601 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:29:43,602 INFO L794 eck$LassoCheckResult]: Stem: 1061#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1056#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 1057#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 1051#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 1052#L521 assume !build_fullname_#t~short10; 1058#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 1068#L523 assume build_fullname_#t~short14; 1054#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 1067#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 1066#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 1045#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 1046#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 1055#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 1040#L515 assume strchr_#t~mem5 == strchr_~ch~0;havoc strchr_#t~mem5; 1041#L514-3 strchr_#res.base, strchr_#res.offset := strchr_~t.base, strchr_~t.offset; 1047#L517 build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset := strchr_#res.base, strchr_#res.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset;havoc build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset;call write~int(47, build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 1);build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;havoc build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset; 1062#L523-4 strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~filename.base, build_fullname_~filename.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 1050#L508-8 [2018-11-23 15:29:43,602 INFO L796 eck$LassoCheckResult]: Loop: 1050#L508-8 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 1049#L508-6 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 1050#L508-8 [2018-11-23 15:29:43,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1119349231, now seen corresponding path program 1 times [2018-11-23 15:29:43,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:43,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:43,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:43,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:43,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:43,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:43,620 INFO L82 PathProgramCache]: Analyzing trace with hash 3590, now seen corresponding path program 2 times [2018-11-23 15:29:43,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:43,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:43,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:43,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:29:43,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:43,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:43,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1952789620, now seen corresponding path program 1 times [2018-11-23 15:29:43,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:29:43,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:29:43,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:43,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:29:43,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:29:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:29:44,716 WARN L180 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 219 [2018-11-23 15:29:44,909 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2018-11-23 15:29:44,911 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:29:44,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:29:44,912 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:29:44,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:29:44,912 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:29:44,912 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:29:44,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:29:44,912 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:29:44,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration7_Lasso [2018-11-23 15:29:44,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:29:44,912 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:29:44,914 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-23 15:29:44,915 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-23 15:29:44,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:44,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:44,918 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-23 15:29:44,918 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-23 15:29:44,922 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-23 15:29:44,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:44,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:44,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:44,925 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-23 15:29:44,926 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-23 15:29:44,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:44,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:44,928 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-23 15:29:44,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:44,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:44,932 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-23 15:29:44,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:44,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:29:44,935 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-23 15:29:44,940 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-23 15:29:44,942 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-23 15:29:44,942 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-23 15:29:44,943 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-23 15:29:44,944 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-23 15:29:44,947 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-23 15:29:44,948 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-23 15:29:45,480 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 132 [2018-11-23 15:29:45,608 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2018-11-23 15:29:45,609 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-23 15:29:45,610 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-23 15:29:45,611 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-23 15:29:45,612 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-23 15:29:45,612 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-23 15:29:45,613 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-23 15:29:46,147 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:29:46,147 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:29:46,147 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-23 15:29:46,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,149 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-23 15:29:46,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,150 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-23 15:29:46,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,152 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-23 15:29:46,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,153 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-23 15:29:46,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,154 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-23 15:29:46,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:46,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:46,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,157 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-23 15:29:46,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,158 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-23 15:29:46,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,159 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-23 15:29:46,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,161 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-23 15:29:46,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,162 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-23 15:29:46,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,164 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-23 15:29:46,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,165 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-23 15:29:46,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,167 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-23 15:29:46,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,168 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-23 15:29:46,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,169 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-23 15:29:46,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:46,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:46,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,172 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-23 15:29:46,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,174 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-23 15:29:46,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:46,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:46,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,176 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-23 15:29:46,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,177 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-23 15:29:46,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,180 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-23 15:29:46,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,181 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-23 15:29:46,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,183 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-23 15:29:46,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,184 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-23 15:29:46,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,185 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-23 15:29:46,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,189 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-23 15:29:46,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,190 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-23 15:29:46,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:29:46,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:29:46,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:29:46,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,192 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-23 15:29:46,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:46,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:46,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:29:46,195 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-23 15:29:46,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:29:46,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:29:46,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:29:46,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:29:46,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:29:46,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:29:46,226 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:29:46,269 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 15:29:46,269 INFO L444 ModelExtractionUtils]: 76 out of 82 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 15:29:46,269 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:29:46,270 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:29:46,270 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:29:46,270 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_4, ULTIMATE.start_strcpy_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_4 - 1*ULTIMATE.start_strcpy_~s2.offset Supporting invariants [] [2018-11-23 15:29:46,461 INFO L297 tatePredicateManager]: 48 out of 49 supporting invariants were superfluous and have been removed [2018-11-23 15:29:46,462 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:29:46,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:29:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:46,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:29:46,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:29:46,557 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-23 15:29:46,557 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 15:29:46,557 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-23 15:29:46,575 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 35 states and 42 transitions. Complement of second has 5 states. [2018-11-23 15:29:46,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 15:29:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:29:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-23 15:29:46,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-23 15:29:46,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:46,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 19 letters. Loop has 2 letters. [2018-11-23 15:29:46,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:46,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-23 15:29:46,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:29:46,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-11-23 15:29:46,578 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:29:46,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2018-11-23 15:29:46,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:29:46,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:29:46,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:29:46,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:29:46,578 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:29:46,578 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:29:46,578 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:29:46,578 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 15:29:46,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:29:46,579 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:29:46,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:29:46,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:29:46 BoogieIcfgContainer [2018-11-23 15:29:46,583 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:29:46,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:29:46,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:29:46,584 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:29:46,584 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:29:34" (3/4) ... [2018-11-23 15:29:46,586 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:29:46,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:29:46,587 INFO L168 Benchmark]: Toolchain (without parser) took 12742.94 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 474.5 MB). Free memory was 955.4 MB in the beginning and 1.5 GB in the end (delta: -505.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:29:46,587 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:29:46,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -208.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:29:46,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.67 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-23 15:29:46,588 INFO L168 Benchmark]: Boogie Preprocessor took 24.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:29:46,589 INFO L168 Benchmark]: RCFGBuilder took 270.19 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:29:46,589 INFO L168 Benchmark]: BuchiAutomizer took 12054.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -326.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:29:46,590 INFO L168 Benchmark]: Witness Printer took 2.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:29:46,592 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -208.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.67 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. * Boogie Preprocessor took 24.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 270.19 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12054.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -326.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] and consists of 6 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] and consists of 4 locations. One deterministic module has affine ranking function -1 * t + unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (file_len)] + -1 * s2 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 11.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 144 SDtfs, 133 SDslu, 157 SDs, 0 SdLazy, 192 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital514 mio100 ax100 hnf99 lsp98 ukn60 mio100 lsp43 div100 bol100 ite100 ukn100 eq203 hnf88 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 7 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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...