./Ultimate.py --spec ../../sv-benchmarks/c/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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/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_16df3f52-bf98-4210-a6c5-e08414a75ff6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/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-5842f4b [2018-11-18 11:41:29,439 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:41:29,440 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:41:29,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:41:29,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:41:29,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:41:29,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:41:29,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:41:29,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:41:29,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:41:29,453 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:41:29,453 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:41:29,454 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:41:29,455 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:41:29,456 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:41:29,456 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:41:29,457 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:41:29,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:41:29,460 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:41:29,461 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:41:29,462 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:41:29,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:41:29,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:41:29,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:41:29,465 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:41:29,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:41:29,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:41:29,467 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:41:29,468 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:41:29,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:41:29,468 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:41:29,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:41:29,469 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:41:29,469 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:41:29,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:41:29,470 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:41:29,471 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 11:41:29,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:41:29,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:41:29,482 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:41:29,482 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:41:29,483 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:41:29,483 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:41:29,483 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:41:29,483 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:41:29,483 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:41:29,483 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:41:29,483 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:41:29,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:41:29,484 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:41:29,484 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:41:29,484 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:41:29,484 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:41:29,484 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:41:29,485 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:41:29,485 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:41:29,485 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:41:29,485 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:41:29,485 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:41:29,485 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:41:29,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:41:29,486 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:41:29,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:41:29,486 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:41:29,486 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:41:29,487 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:41:29,487 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_16df3f52-bf98-4210-a6c5-e08414a75ff6/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-18 11:41:29,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:41:29,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:41:29,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:41:29,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:41:29,523 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:41:29,523 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/build_fullname_true-termination.c.i [2018-11-18 11:41:29,565 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/bin-2019/uautomizer/data/4d00fb107/4927603ab6744bc6ba5963260ab8f753/FLAG39e000c64 [2018-11-18 11:41:29,922 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:41:29,922 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/sv-benchmarks/c/termination-libowfat/build_fullname_true-termination.c.i [2018-11-18 11:41:29,932 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/bin-2019/uautomizer/data/4d00fb107/4927603ab6744bc6ba5963260ab8f753/FLAG39e000c64 [2018-11-18 11:41:29,942 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/bin-2019/uautomizer/data/4d00fb107/4927603ab6744bc6ba5963260ab8f753 [2018-11-18 11:41:29,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:41:29,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:41:29,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:41:29,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:41:29,950 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:41:29,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:41:29" (1/1) ... [2018-11-18 11:41:29,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c938308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:29, skipping insertion in model container [2018-11-18 11:41:29,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:41:29" (1/1) ... [2018-11-18 11:41:29,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:41:29,994 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:41:30,200 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:41:30,205 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:41:30,237 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:41:30,307 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:41:30,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:30 WrapperNode [2018-11-18 11:41:30,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:41:30,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:41:30,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:41:30,308 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:41:30,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:30" (1/1) ... [2018-11-18 11:41:30,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:30" (1/1) ... [2018-11-18 11:41:30,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:41:30,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:41:30,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:41:30,341 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:41:30,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:30" (1/1) ... [2018-11-18 11:41:30,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:30" (1/1) ... [2018-11-18 11:41:30,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:30" (1/1) ... [2018-11-18 11:41:30,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:30" (1/1) ... [2018-11-18 11:41:30,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:30" (1/1) ... [2018-11-18 11:41:30,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:30" (1/1) ... [2018-11-18 11:41:30,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:30" (1/1) ... [2018-11-18 11:41:30,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:41:30,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:41:30,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:41:30,361 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:41:30,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:41:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 11:41:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 11:41:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 11:41:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 11:41:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:41:30,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:41:30,648 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:41:30,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:41:30 BoogieIcfgContainer [2018-11-18 11:41:30,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:41:30,649 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:41:30,649 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:41:30,651 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:41:30,652 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:41:30,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:41:29" (1/3) ... [2018-11-18 11:41:30,652 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e9a312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:41:30, skipping insertion in model container [2018-11-18 11:41:30,652 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:41:30,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:41:30" (2/3) ... [2018-11-18 11:41:30,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e9a312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:41:30, skipping insertion in model container [2018-11-18 11:41:30,653 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:41:30,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:41:30" (3/3) ... [2018-11-18 11:41:30,654 INFO L375 chiAutomizerObserver]: Analyzing ICFG build_fullname_true-termination.c.i [2018-11-18 11:41:30,690 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:41:30,691 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:41:30,691 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:41:30,691 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:41:30,691 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:41:30,691 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:41:30,691 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:41:30,691 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:41:30,691 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:41:30,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-18 11:41:30,719 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-18 11:41:30,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:41:30,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:41:30,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:41:30,724 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 11:41:30,724 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:41:30,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-18 11:41:30,726 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-18 11:41:30,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:41:30,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:41:30,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:41:30,726 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 11:41:30,732 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~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; 23#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;assume { :begin_inline_build_fullname } true;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; 14#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; 15#L523-4true assume { :begin_inline_strcpy } true;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; 29#L508-10true [2018-11-18 11:41:30,732 INFO L796 eck$LassoCheckResult]: Loop: 29#L508-10true assume true; 7#L508-7true 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); 26#L508-8true assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 29#L508-10true [2018-11-18 11:41:30,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905921, now seen corresponding path program 1 times [2018-11-18 11:41:30,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:30,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:30,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:30,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:30,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:30,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:30,876 INFO L82 PathProgramCache]: Analyzing trace with hash 112279, now seen corresponding path program 1 times [2018-11-18 11:41:30,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:30,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:30,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:30,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:30,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:30,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 709254231, now seen corresponding path program 1 times [2018-11-18 11:41:30,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:30,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:30,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:30,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:30,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:31,726 WARN L180 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 148 [2018-11-18 11:41:31,997 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-18 11:41:32,009 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:41:32,010 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:41:32,010 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:41:32,010 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:41:32,011 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:41:32,011 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:41:32,011 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:41:32,011 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:41:32,011 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration1_Lasso [2018-11-18 11:41:32,011 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:41:32,012 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:41:32,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:32,547 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 116 [2018-11-18 11:41:32,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-18 11:41:32,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-18 11:41:32,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-18 11:41:32,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-18 11:41:32,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-18 11:41:32,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-18 11:41:32,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-18 11:41:33,121 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:41:33,125 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:41:33,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:33,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:33,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,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-18 11:41:33,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,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-18 11:41:33,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,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-18 11:41:33,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,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-18 11:41:33,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,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-18 11:41:33,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,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-18 11:41:33,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,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-18 11:41:33,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,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-18 11:41:33,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:33,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:33,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:33,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:33,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,187 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:41:33,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,190 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:41:33,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:33,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:33,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:33,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,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-18 11:41:33,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,211 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:41:33,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,211 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:41:33,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,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-18 11:41:33,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,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-18 11:41:33,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:33,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:33,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:33,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:33,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,225 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:41:33,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,228 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:41:33,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:33,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,238 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:41:33,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,240 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:41:33,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:33,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:33,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:33,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:33,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:33,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:33,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:33,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:33,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:33,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:33,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:33,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:33,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:33,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:33,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:33,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:33,318 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:41:33,363 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 11:41:33,364 INFO L444 ModelExtractionUtils]: 70 out of 79 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-18 11:41:33,365 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:41:33,367 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:41:33,367 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:41:33,367 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcpy_~s2.base)_1, ULTIMATE.start_strcpy_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_strcpy_~s2.base)_1 - 1*ULTIMATE.start_strcpy_~s2.offset Supporting invariants [] [2018-11-18 11:41:33,485 INFO L297 tatePredicateManager]: 35 out of 35 supporting invariants were superfluous and have been removed [2018-11-18 11:41:33,490 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:41:33,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:41:33,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:41:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:41:33,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:41:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:41:33,596 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 11:41:33,597 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 4 states. [2018-11-18 11:41:33,630 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states.. Second operand 4 states. Result 61 states and 79 transitions. Complement of second has 5 states. [2018-11-18 11:41:33,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 11:41:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:41:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-18 11:41:33,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-18 11:41:33,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:41:33,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-18 11:41:33,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:41:33,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-18 11:41:33,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:41:33,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 79 transitions. [2018-11-18 11:41:33,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:41:33,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 17 states and 20 transitions. [2018-11-18 11:41:33,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 11:41:33,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 11:41:33,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-18 11:41:33,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:41:33,643 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 11:41:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-18 11:41:33,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 11:41:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 11:41:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-18 11:41:33,660 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 11:41:33,660 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 11:41:33,660 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:41:33,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-18 11:41:33,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:41:33,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:41:33,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:41:33,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:41:33,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 11:41:33,661 INFO L794 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 296#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 297#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 292#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;assume { :begin_inline_build_fullname } true;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; 293#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; 298#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; 294#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; 295#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;havoc build_fullname_#t~mem12;assume { :begin_inline_strcpy } true;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; 286#L508-4 [2018-11-18 11:41:33,662 INFO L796 eck$LassoCheckResult]: Loop: 286#L508-4 assume true; 287#L508-1 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); 300#L508-2 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 286#L508-4 [2018-11-18 11:41:33,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:33,662 INFO L82 PathProgramCache]: Analyzing trace with hash 179509076, now seen corresponding path program 1 times [2018-11-18 11:41:33,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:33,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:33,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:33,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:33,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:41:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:41:33,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:41:33,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:41:33,725 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:41:33,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:33,725 INFO L82 PathProgramCache]: Analyzing trace with hash 65608, now seen corresponding path program 1 times [2018-11-18 11:41:33,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:33,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:33,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:33,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:41:33,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:41:33,795 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-18 11:41:33,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:41:33,841 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-18 11:41:33,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:41:33,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-18 11:41:33,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:41:33,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2018-11-18 11:41:33,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-18 11:41:33,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-18 11:41:33,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-11-18 11:41:33,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:41:33,843 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-18 11:41:33,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-11-18 11:41:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-11-18 11:41:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 11:41:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-18 11:41:33,845 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 11:41:33,845 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 11:41:33,845 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:41:33,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-18 11:41:33,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:41:33,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:41:33,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:41:33,846 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:41:33,846 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 11:41:33,846 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 346#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 347#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 342#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;assume { :begin_inline_build_fullname } true;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; 343#L521 assume !build_fullname_#t~short10; 348#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; 351#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; 345#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;havoc build_fullname_#t~mem12;assume { :begin_inline_strcpy } true;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; 336#L508-4 [2018-11-18 11:41:33,846 INFO L796 eck$LassoCheckResult]: Loop: 336#L508-4 assume true; 337#L508-1 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); 352#L508-2 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 336#L508-4 [2018-11-18 11:41:33,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:33,846 INFO L82 PathProgramCache]: Analyzing trace with hash 179568658, now seen corresponding path program 1 times [2018-11-18 11:41:33,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:33,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:33,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:33,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:33,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:33,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:33,863 INFO L82 PathProgramCache]: Analyzing trace with hash 65608, now seen corresponding path program 2 times [2018-11-18 11:41:33,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:33,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:33,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:33,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:33,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:33,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1999324521, now seen corresponding path program 1 times [2018-11-18 11:41:33,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:33,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:33,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:33,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:41:33,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:34,397 WARN L180 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 147 [2018-11-18 11:41:34,533 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-18 11:41:34,534 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:41:34,535 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:41:34,535 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:41:34,535 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:41:34,535 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:41:34,535 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:41:34,535 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:41:34,535 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:41:34,535 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration3_Lasso [2018-11-18 11:41:34,535 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:41:34,535 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:41:34,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:34,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:35,020 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 122 [2018-11-18 11:41:35,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-18 11:41:35,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-18 11:41:35,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:35,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:35,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:35,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:35,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:35,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:35,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:35,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:35,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:35,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:35,255 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-11-18 11:41:35,613 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:41:35,613 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:41:35,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:35,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:35,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:35,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:35,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:35,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:35,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:35,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:35,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:35,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:35,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:35,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:35,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:35,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:35,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:35,678 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:41:35,686 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 11:41:35,686 INFO L444 ModelExtractionUtils]: 57 out of 61 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 11:41:35,686 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:41:35,687 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:41:35,687 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:41:35,687 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcpy_~s2.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2) = -1*ULTIMATE.start_strcpy_~s2.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2 Supporting invariants [] [2018-11-18 11:41:35,773 INFO L297 tatePredicateManager]: 32 out of 34 supporting invariants were superfluous and have been removed [2018-11-18 11:41:35,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:41:35,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:41:35,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:41:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:41:35,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:41:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:41:35,842 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-18 11:41:35,842 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-18 11:41:35,874 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2018-11-18 11:41:35,875 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-18 11:41:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:41:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-18 11:41:35,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 11:41:35,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:41:35,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 11:41:35,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:41:35,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 11:41:35,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:41:35,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 33 transitions. [2018-11-18 11:41:35,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:41:35,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 20 states and 23 transitions. [2018-11-18 11:41:35,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 11:41:35,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 11:41:35,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-18 11:41:35,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:41:35,878 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-18 11:41:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-18 11:41:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 11:41:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 11:41:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-18 11:41:35,880 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-18 11:41:35,880 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-18 11:41:35,880 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:41:35,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-18 11:41:35,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:41:35,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:41:35,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:41:35,881 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:41:35,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:41:35,882 INFO L794 eck$LassoCheckResult]: Stem: 596#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 592#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 593#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 588#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;assume { :begin_inline_build_fullname } true;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; 589#L521 assume !build_fullname_#t~short10; 594#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; 598#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; 591#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;havoc build_fullname_#t~mem12;assume { :begin_inline_strcpy } true;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; 581#L508-4 assume true; 582#L508-1 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); 597#L508-2 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 584#L508-5 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 585#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;assume { :end_inline_strcpy } true;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;assume { :begin_inline_strchr } true;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); 586#L514-3 [2018-11-18 11:41:35,882 INFO L796 eck$LassoCheckResult]: Loop: 586#L514-3 assume true; 587#L514-1 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 579#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); 580#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; 586#L514-3 [2018-11-18 11:41:35,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:35,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1500483785, now seen corresponding path program 1 times [2018-11-18 11:41:35,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:35,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:35,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:35,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:35,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:41:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:41:35,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:41:35,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:41:35,929 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:41:35,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:35,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2560203, now seen corresponding path program 1 times [2018-11-18 11:41:35,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:35,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:35,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:35,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:35,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:35,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:41:35,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:41:35,956 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-18 11:41:36,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:41:36,006 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-18 11:41:36,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:41:36,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2018-11-18 11:41:36,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:41:36,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 29 transitions. [2018-11-18 11:41:36,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 11:41:36,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 11:41:36,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2018-11-18 11:41:36,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:41:36,009 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-18 11:41:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2018-11-18 11:41:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-18 11:41:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 11:41:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-18 11:41:36,011 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-18 11:41:36,011 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-18 11:41:36,011 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 11:41:36,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-18 11:41:36,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:41:36,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:41:36,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:41:36,014 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:41:36,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:41:36,014 INFO L794 eck$LassoCheckResult]: Stem: 655#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 651#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 652#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 647#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;assume { :begin_inline_build_fullname } true;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; 648#L521 assume !build_fullname_#t~short10; 653#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; 661#L523 assume build_fullname_#t~short14; 650#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;havoc build_fullname_#t~mem12;assume { :begin_inline_strcpy } true;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; 640#L508-4 assume true; 641#L508-1 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); 656#L508-2 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 643#L508-5 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 644#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;assume { :end_inline_strcpy } true;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;assume { :begin_inline_strchr } true;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); 646#L514-3 [2018-11-18 11:41:36,014 INFO L796 eck$LassoCheckResult]: Loop: 646#L514-3 assume true; 645#L514-1 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 638#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); 639#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; 646#L514-3 [2018-11-18 11:41:36,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:36,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1019476149, now seen corresponding path program 1 times [2018-11-18 11:41:36,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:36,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:36,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:36,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:36,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:36,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:36,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2560203, now seen corresponding path program 2 times [2018-11-18 11:41:36,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:36,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:36,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:36,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:36,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:36,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:36,040 INFO L82 PathProgramCache]: Analyzing trace with hash -736653441, now seen corresponding path program 1 times [2018-11-18 11:41:36,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:36,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:36,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:41:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:41:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:41:36,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:41:36,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:41:36,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:41:36,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:41:36,116 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-18 11:41:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:41:36,171 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-18 11:41:36,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:41:36,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-11-18 11:41:36,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:41:36,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 29 transitions. [2018-11-18 11:41:36,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 11:41:36,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 11:41:36,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2018-11-18 11:41:36,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:41:36,174 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-18 11:41:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2018-11-18 11:41:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-11-18 11:41:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 11:41:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-18 11:41:36,176 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 11:41:36,176 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 11:41:36,176 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 11:41:36,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-18 11:41:36,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:41:36,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:41:36,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:41:36,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:41:36,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:41:36,178 INFO L794 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 724#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 725#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 720#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;assume { :begin_inline_build_fullname } true;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; 721#L521 assume !build_fullname_#t~short10; 726#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; 731#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; 723#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;havoc build_fullname_#t~mem12;assume { :begin_inline_strcpy } true;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; 712#L508-4 assume true; 713#L508-1 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); 729#L508-2 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 714#L508-4 assume true; 715#L508-1 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); 730#L508-2 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 716#L508-5 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 717#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;assume { :end_inline_strcpy } true;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;assume { :begin_inline_strchr } true;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); 719#L514-3 [2018-11-18 11:41:36,179 INFO L796 eck$LassoCheckResult]: Loop: 719#L514-3 assume true; 718#L514-1 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 710#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); 711#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; 719#L514-3 [2018-11-18 11:41:36,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1153990610, now seen corresponding path program 1 times [2018-11-18 11:41:36,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:36,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:36,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:36,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:36,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:41:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:41:36,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:41:36,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16df3f52-bf98-4210-a6c5-e08414a75ff6/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:41:36,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:41:36,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:41:36,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-11-18 11:41:36,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 11:41:36,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:41:36,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-18 11:41:36,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-18 11:41:36,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:41:36,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:41:36,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:41:36,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-18 11:41:36,383 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:27 [2018-11-18 11:41:36,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 54 [2018-11-18 11:41:36,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-11-18 11:41:36,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:41:36,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2018-11-18 11:41:36,574 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 11:41:36,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 11:41:36,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 11:41:36,610 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:60 [2018-11-18 11:41:36,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 50 [2018-11-18 11:41:36,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 11:41:36,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:41:36,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-18 11:41:36,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:41:36,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-18 11:41:36,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:41:36,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-18 11:41:36,945 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 11:41:37,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2018-11-18 11:41:37,020 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 11:41:37,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-18 11:41:37,035 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 11:41:37,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 11:41:37,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-18 11:41:37,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 11:41:37,061 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 11:41:37,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-18 11:41:37,069 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 11:41:37,071 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:41:37,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:41:37,078 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:68, output treesize:4 [2018-11-18 11:41:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:41:37,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:41:37,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-18 11:41:37,096 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:41:37,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:37,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2560203, now seen corresponding path program 3 times [2018-11-18 11:41:37,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:37,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:37,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:37,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:37,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:37,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:41:37,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:41:37,135 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-18 11:41:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:41:37,353 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-18 11:41:37,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:41:37,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 34 transitions. [2018-11-18 11:41:37,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:41:37,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 34 transitions. [2018-11-18 11:41:37,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 11:41:37,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 11:41:37,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 34 transitions. [2018-11-18 11:41:37,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:41:37,355 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-18 11:41:37,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 34 transitions. [2018-11-18 11:41:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-18 11:41:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 11:41:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-18 11:41:37,356 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-18 11:41:37,356 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-18 11:41:37,356 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 11:41:37,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2018-11-18 11:41:37,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:41:37,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:41:37,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:41:37,357 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:41:37,357 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:41:37,357 INFO L794 eck$LassoCheckResult]: Stem: 853#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 847#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 848#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 843#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;assume { :begin_inline_build_fullname } true;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; 844#L521 assume !build_fullname_#t~short10; 849#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; 854#L523 assume build_fullname_#t~short14; 846#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;havoc build_fullname_#t~mem12;assume { :begin_inline_strcpy } true;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; 836#L508-4 assume true; 837#L508-1 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); 855#L508-2 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 856#L508-4 assume true; 858#L508-1 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); 857#L508-2 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 839#L508-5 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 840#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;assume { :end_inline_strcpy } true;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;assume { :begin_inline_strchr } true;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); 841#L514-3 [2018-11-18 11:41:37,357 INFO L796 eck$LassoCheckResult]: Loop: 841#L514-3 assume true; 842#L514-1 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 834#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); 835#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; 841#L514-3 [2018-11-18 11:41:37,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1547017620, now seen corresponding path program 1 times [2018-11-18 11:41:37,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:37,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:37,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:41:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:37,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2560203, now seen corresponding path program 4 times [2018-11-18 11:41:37,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:37,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:37,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:41:37,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:37,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:37,389 INFO L82 PathProgramCache]: Analyzing trace with hash -430068514, now seen corresponding path program 1 times [2018-11-18 11:41:37,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:41:37,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:41:37,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:37,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:41:37,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:41:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:41:38,461 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 267 DAG size of output: 225 [2018-11-18 11:41:39,395 WARN L180 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 168 [2018-11-18 11:41:39,397 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:41:39,397 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:41:39,397 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:41:39,397 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:41:39,397 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:41:39,397 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:41:39,397 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:41:39,397 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:41:39,397 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration7_Lasso [2018-11-18 11:41:39,397 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:41:39,397 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:41:39,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,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-18 11:41:39,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,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-18 11:41:39,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-18 11:41:39,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:39,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-18 11:41:39,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-18 11:41:39,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-18 11:41:39,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-18 11:41:39,992 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 141 [2018-11-18 11:41:40,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:40,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:41:40,358 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2018-11-18 11:41:40,695 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:41:40,695 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:41:40,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:40,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:40,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:40,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:40,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,744 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:41:40,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,746 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:41:40,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:40,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:40,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:40,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:40,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:40,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:40,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:40,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:41:40,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:41:40,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:41:40,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,767 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:41:40,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,768 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:41:40,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:40,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:41:40,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:41:40,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:41:40,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:41:40,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:41:40,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:41:40,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:41:40,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:41:40,804 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:41:40,823 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 11:41:40,823 INFO L444 ModelExtractionUtils]: 87 out of 91 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 11:41:40,823 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:41:40,824 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:41:40,824 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:41:40,824 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3, ULTIMATE.start_strchr_~t.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3 - 1*ULTIMATE.start_strchr_~t.offset Supporting invariants [] [2018-11-18 11:41:41,015 INFO L297 tatePredicateManager]: 39 out of 40 supporting invariants were superfluous and have been removed [2018-11-18 11:41:41,016 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:41:41,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:41:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:41:41,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:41:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:41:41,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:41:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:41:41,073 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-18 11:41:41,073 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-18 11:41:41,095 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 31 states and 35 transitions. Complement of second has 7 states. [2018-11-18 11:41:41,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:41:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:41:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-18 11:41:41,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 11:41:41,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:41:41,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 11:41:41,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:41:41,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-18 11:41:41,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:41:41,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-18 11:41:41,098 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:41:41,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-11-18 11:41:41,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:41:41,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:41:41,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:41:41,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:41:41,098 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:41:41,098 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:41:41,098 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:41:41,098 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 11:41:41,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:41:41,099 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:41:41,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 11:41:41,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:41:41 BoogieIcfgContainer [2018-11-18 11:41:41,104 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:41:41,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:41:41,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:41:41,105 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:41:41,105 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:41:30" (3/4) ... [2018-11-18 11:41:41,108 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:41:41,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:41:41,109 INFO L168 Benchmark]: Toolchain (without parser) took 11163.80 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.5 MB). Free memory was 955.4 MB in the beginning and 893.4 MB in the end (delta: 62.0 MB). Peak memory consumption was 342.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:41:41,110 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:41:41,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-11-18 11:41:41,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:41:41,111 INFO L168 Benchmark]: Boogie Preprocessor took 19.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:41:41,112 INFO L168 Benchmark]: RCFGBuilder took 287.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:41:41,112 INFO L168 Benchmark]: BuchiAutomizer took 10455.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 146.8 MB). Free memory was 1.1 GB in the beginning and 893.4 MB in the end (delta: 197.8 MB). Peak memory consumption was 344.6 MB. Max. memory is 11.5 GB. [2018-11-18 11:41:41,113 INFO L168 Benchmark]: Witness Printer took 3.87 ms. Allocated memory is still 1.3 GB. Free memory is still 893.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:41:41,115 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 287.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10455.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 146.8 MB). Free memory was 1.1 GB in the beginning and 893.4 MB in the end (delta: 197.8 MB). Peak memory consumption was 344.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.87 ms. Allocated memory is still 1.3 GB. Free memory is still 893.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * s2 and consists of 4 locations. One deterministic module has affine ranking function -1 * s2 + 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 (dir_len+file_len+2)] + -1 * t and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 9.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 133 SDtfs, 132 SDslu, 216 SDs, 0 SdLazy, 212 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital461 mio100 ax100 hnf99 lsp98 ukn65 mio100 lsp45 div100 bol100 ite100 ukn100 eq201 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 8 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...