./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/build_fullname.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/build_fullname.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/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.24-cad4683 [2019-11-15 20:20:47,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:20:47,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:20:47,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:20:47,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:20:47,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:20:47,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:20:47,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:20:47,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:20:47,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:20:47,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:20:47,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:20:47,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:20:47,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:20:47,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:20:47,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:20:47,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:20:47,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:20:47,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:20:47,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:20:47,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:20:47,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:20:47,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:20:47,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:20:47,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:20:47,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:20:47,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:20:47,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:20:47,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:20:47,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:20:47,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:20:47,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:20:47,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:20:47,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:20:47,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:20:47,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:20:47,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:20:47,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:20:47,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:20:47,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:20:47,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:20:47,555 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 20:20:47,575 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:20:47,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:20:47,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:20:47,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:20:47,578 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:20:47,578 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:20:47,578 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:20:47,578 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:20:47,579 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:20:47,579 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:20:47,580 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:20:47,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:20:47,580 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:20:47,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:20:47,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:20:47,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:20:47,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:20:47,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:20:47,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:20:47,582 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:20:47,582 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:20:47,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:20:47,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:20:47,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:20:47,584 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:20:47,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:20:47,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:20:47,585 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:20:47,588 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:20:47,588 INFO L138 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/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/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 [2019-11-15 20:20:47,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:20:47,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:20:47,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:20:47,659 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:20:47,659 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:20:47,660 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/build_fullname.i [2019-11-15 20:20:47,721 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/uautomizer/data/8ce87434f/6ac3b1f9079b4218a3d00c847a081b73/FLAG351e51d5b [2019-11-15 20:20:48,237 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:20:48,238 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/sv-benchmarks/c/termination-libowfat/build_fullname.i [2019-11-15 20:20:48,256 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/uautomizer/data/8ce87434f/6ac3b1f9079b4218a3d00c847a081b73/FLAG351e51d5b [2019-11-15 20:20:48,571 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/uautomizer/data/8ce87434f/6ac3b1f9079b4218a3d00c847a081b73 [2019-11-15 20:20:48,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:20:48,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:20:48,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:20:48,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:20:48,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:20:48,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:20:48" (1/1) ... [2019-11-15 20:20:48,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b5b72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:48, skipping insertion in model container [2019-11-15 20:20:48,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:20:48" (1/1) ... [2019-11-15 20:20:48,595 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:20:48,625 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:20:49,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:20:49,013 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:20:49,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:20:49,104 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:20:49,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:49 WrapperNode [2019-11-15 20:20:49,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:20:49,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:20:49,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:20:49,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:20:49,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:49" (1/1) ... [2019-11-15 20:20:49,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:49" (1/1) ... [2019-11-15 20:20:49,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:20:49,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:20:49,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:20:49,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:20:49,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:49" (1/1) ... [2019-11-15 20:20:49,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:49" (1/1) ... [2019-11-15 20:20:49,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:49" (1/1) ... [2019-11-15 20:20:49,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:49" (1/1) ... [2019-11-15 20:20:49,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:49" (1/1) ... [2019-11-15 20:20:49,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:49" (1/1) ... [2019-11-15 20:20:49,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:49" (1/1) ... [2019-11-15 20:20:49,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:20:49,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:20:49,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:20:49,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:20:49,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/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 [2019-11-15 20:20:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:20:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:20:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:20:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:20:49,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:20:49,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:20:49,713 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:20:49,713 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-15 20:20:49,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:20:49 BoogieIcfgContainer [2019-11-15 20:20:49,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:20:49,715 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:20:49,715 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:20:49,718 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:20:49,719 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:20:49,720 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:20:48" (1/3) ... [2019-11-15 20:20:49,721 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6654ca68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:20:49, skipping insertion in model container [2019-11-15 20:20:49,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:20:49,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:20:49" (2/3) ... [2019-11-15 20:20:49,721 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6654ca68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:20:49, skipping insertion in model container [2019-11-15 20:20:49,722 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:20:49,722 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:20:49" (3/3) ... [2019-11-15 20:20:49,723 INFO L371 chiAutomizerObserver]: Analyzing ICFG build_fullname.i [2019-11-15 20:20:49,783 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:20:49,784 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:20:49,786 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:20:49,786 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:20:49,786 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:20:49,786 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:20:49,787 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:20:49,787 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:20:49,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-15 20:20:49,830 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-15 20:20:49,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:20:49,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:20:49,837 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:20:49,837 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:20:49,837 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:20:49,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-15 20:20:49,842 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-15 20:20:49,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:20:49,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:20:49,844 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:20:49,844 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:20:49,851 INFO L791 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 9#L532true assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 20#L534true assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 10#L521true assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 13#L521-2true assume build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;call write~int(47, build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 1);build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;havoc build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset; 14#L523-4true strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~filename.base, build_fullname_~filename.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 24#L508-8true [2019-11-15 20:20:49,857 INFO L793 eck$LassoCheckResult]: Loop: 24#L508-8true strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 7#L508-6true assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 24#L508-8true [2019-11-15 20:20:49,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:20:49,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905919, now seen corresponding path program 1 times [2019-11-15 20:20:49,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:20:49,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112742036] [2019-11-15 20:20:49,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:49,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:49,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:20:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:50,138 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:20:50,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:20:50,139 INFO L82 PathProgramCache]: Analyzing trace with hash 3590, now seen corresponding path program 1 times [2019-11-15 20:20:50,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:20:50,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807865426] [2019-11-15 20:20:50,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:50,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:50,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:20:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:50,159 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:20:50,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:20:50,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1269803204, now seen corresponding path program 1 times [2019-11-15 20:20:50,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:20:50,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869828924] [2019-11-15 20:20:50,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:50,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:50,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:20:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:50,308 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:20:50,518 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-15 20:20:51,867 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 189 DAG size of output: 154 [2019-11-15 20:20:52,368 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-11-15 20:20:52,385 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:20:52,387 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:20:52,387 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:20:52,387 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:20:52,388 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:20:52,388 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:20:52,388 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:20:52,388 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:20:52,389 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname.i_Iteration1_Lasso [2019-11-15 20:20:52,389 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:20:52,389 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:20:52,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:52,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,375 WARN L191 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 121 [2019-11-15 20:20:53,556 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-15 20:20:53,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:53,766 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 20:20:53,947 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-15 20:20:55,638 WARN L191 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-11-15 20:20:55,810 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-15 20:20:55,901 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:20:55,906 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:20:55,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,910 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,910 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,911 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,913 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,913 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,916 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,916 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,917 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,917 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,917 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,917 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,919 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,919 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,919 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,920 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,922 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:20:55,922 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:20:55,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,926 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,926 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,927 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,927 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,929 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,929 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,930 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,930 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,931 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,932 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,932 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,932 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,932 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,933 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,933 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,935 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,935 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,936 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,936 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,937 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,938 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,939 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,939 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,941 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,941 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,941 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,942 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,942 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,944 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,944 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,944 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,944 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,945 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,945 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,947 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,947 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,948 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,948 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,950 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,950 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,950 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,951 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,951 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,953 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,953 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,954 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,954 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,954 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,956 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,957 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,957 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,957 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,959 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:55,959 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:55,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:55,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,962 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:55,962 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,963 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:55,966 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:20:55,966 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:20:55,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:55,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:55,980 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:55,980 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:20:55,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:55,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:56,005 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 20:20:56,006 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:20:56,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:56,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:56,130 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:56,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:56,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:56,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:56,131 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:20:56,132 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:20:56,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:56,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:56,135 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:56,136 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:20:56,136 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:56,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:56,136 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:56,136 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:20:56,137 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:20:56,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:56,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:56,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:56,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:56,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:56,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:56,140 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:20:56,140 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:20:56,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:56,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:56,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:56,142 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:56,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:56,143 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:56,144 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:20:56,144 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:20:56,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:20:56,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:20:56,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:20:56,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:20:56,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:20:56,149 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:20:56,155 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:20:56,156 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:20:56,205 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:20:56,242 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:20:56,242 INFO L444 ModelExtractionUtils]: 75 out of 79 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:20:56,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:20:56,245 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:20:56,246 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:20:56,246 INFO L512 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 [] [2019-11-15 20:20:56,401 INFO L297 tatePredicateManager]: 35 out of 35 supporting invariants were superfluous and have been removed [2019-11-15 20:20:56,409 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:20:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:20:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:20:56,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:20:56,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:20:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:20:56,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:20:56,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:20:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:20:56,560 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 [2019-11-15 20:20:56,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 3 states. [2019-11-15 20:20:56,614 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 3 states. Result 54 states and 72 transitions. Complement of second has 5 states. [2019-11-15 20:20:56,618 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 [2019-11-15 20:20:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:20:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2019-11-15 20:20:56,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:20:56,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:20:56,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 20:20:56,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:20:56,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 20:20:56,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:20:56,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 72 transitions. [2019-11-15 20:20:56,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 20:20:56,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 15 states and 18 transitions. [2019-11-15 20:20:56,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 20:20:56,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 20:20:56,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2019-11-15 20:20:56,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:20:56,649 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 20:20:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2019-11-15 20:20:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 20:20:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 20:20:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-15 20:20:56,676 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 20:20:56,676 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 20:20:56,676 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:20:56,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-15 20:20:56,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 20:20:56,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:20:56,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:20:56,680 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:20:56,680 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:20:56,680 INFO L791 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 282#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 283#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 278#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 279#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; 284#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;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; 280#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; 281#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;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; 271#L508-3 [2019-11-15 20:20:56,680 INFO L793 eck$LassoCheckResult]: Loop: 271#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 272#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 271#L508-3 [2019-11-15 20:20:56,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:20:56,681 INFO L82 PathProgramCache]: Analyzing trace with hash 179509076, now seen corresponding path program 1 times [2019-11-15 20:20:56,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:20:56,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593070778] [2019-11-15 20:20:56,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:56,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:56,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:20:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:20:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:20:56,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593070778] [2019-11-15 20:20:56,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:20:56,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:20:56,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559719519] [2019-11-15 20:20:56,781 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:20:56,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:20:56,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 1 times [2019-11-15 20:20:56,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:20:56,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955488024] [2019-11-15 20:20:56,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:56,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:56,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:20:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:56,798 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:20:56,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:20:56,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:20:56,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:20:56,904 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-15 20:20:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:20:56,979 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-11-15 20:20:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:20:56,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-11-15 20:20:56,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 20:20:56,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2019-11-15 20:20:56,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 20:20:56,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 20:20:56,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-11-15 20:20:56,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:20:56,982 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 20:20:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-11-15 20:20:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-11-15 20:20:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 20:20:56,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-15 20:20:56,985 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 20:20:56,985 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 20:20:56,985 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:20:56,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-15 20:20:56,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 20:20:56,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:20:56,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:20:56,986 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:20:56,986 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:20:56,987 INFO L791 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 327#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 328#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 323#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 324#L521 assume !build_fullname_#t~short10; 329#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;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; 332#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; 326#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;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; 316#L508-3 [2019-11-15 20:20:56,987 INFO L793 eck$LassoCheckResult]: Loop: 316#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 317#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 316#L508-3 [2019-11-15 20:20:56,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:20:56,987 INFO L82 PathProgramCache]: Analyzing trace with hash 179568658, now seen corresponding path program 1 times [2019-11-15 20:20:56,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:20:56,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685669687] [2019-11-15 20:20:56,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:56,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:56,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:20:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:57,052 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:20:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:20:57,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 2 times [2019-11-15 20:20:57,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:20:57,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754466261] [2019-11-15 20:20:57,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:57,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:57,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:20:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:57,068 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:20:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:20:57,070 INFO L82 PathProgramCache]: Analyzing trace with hash 766789687, now seen corresponding path program 1 times [2019-11-15 20:20:57,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:20:57,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558945262] [2019-11-15 20:20:57,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:57,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:20:57,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:20:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:20:57,125 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:20:58,279 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 184 DAG size of output: 153 [2019-11-15 20:20:58,662 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-15 20:20:58,665 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:20:58,665 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:20:58,665 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:20:58,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:20:58,666 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:20:58,666 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:20:58,666 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:20:58,666 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:20:58,666 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname.i_Iteration3_Lasso [2019-11-15 20:20:58,666 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:20:58,666 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:20:58,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:58,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:59,601 WARN L191 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 127 [2019-11-15 20:20:59,855 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-11-15 20:20:59,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:59,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:59,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:59,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:59,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:59,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:59,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:20:59,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:00,117 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-15 20:21:00,295 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 20:21:02,384 WARN L191 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-11-15 20:21:02,480 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:21:02,481 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:21:02,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,482 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,483 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,483 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,483 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,483 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,484 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,484 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,486 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,487 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,487 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,488 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,490 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,490 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,491 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,491 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:21:02,492 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:21:02,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,495 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,496 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,496 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,498 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,498 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,498 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,499 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,499 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,501 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,501 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,501 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,502 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,502 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,504 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,504 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,505 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,505 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,505 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,506 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,507 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,508 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,508 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,508 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,508 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,509 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,509 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,511 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,511 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,511 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,511 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,512 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,512 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,513 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,514 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,514 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,514 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,514 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,515 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,515 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,517 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,517 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,517 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,517 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,517 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,518 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,518 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,520 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,520 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,521 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,521 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,521 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,521 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,523 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,523 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,523 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,524 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,524 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,526 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,527 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,527 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,529 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,529 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,530 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,530 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,531 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,532 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,533 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,533 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,534 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,534 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,536 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,537 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,537 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,539 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,539 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,540 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,540 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,542 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,543 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:21:02,543 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:21:02,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,546 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,546 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,547 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,547 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,549 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:02,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,550 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:02,550 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:02,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,552 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,553 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,553 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:21:02,554 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:21:02,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:02,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:02,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:02,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:02,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:02,558 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:02,562 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:21:02,563 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:21:02,624 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:21:02,728 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-15 20:21:02,728 INFO L444 ModelExtractionUtils]: 53 out of 61 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 20:21:02,729 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:21:02,730 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:21:02,730 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:21:02,731 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcpy_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2) = -1*ULTIMATE.start_strcpy_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2 Supporting invariants [] [2019-11-15 20:21:02,879 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2019-11-15 20:21:02,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:21:02,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:21:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:21:02,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:21:02,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:21:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:21:02,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 20:21:02,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:21:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:21:02,996 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 [2019-11-15 20:21:02,996 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-15 20:21:03,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 24 states and 28 transitions. Complement of second has 5 states. [2019-11-15 20:21:03,072 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 [2019-11-15 20:21:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:21:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-11-15 20:21:03,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-15 20:21:03,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:21:03,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-15 20:21:03,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:21:03,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-15 20:21:03,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:21:03,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2019-11-15 20:21:03,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:21:03,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 21 transitions. [2019-11-15 20:21:03,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 20:21:03,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 20:21:03,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-15 20:21:03,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:21:03,077 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 20:21:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-15 20:21:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 20:21:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 20:21:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-15 20:21:03,082 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 20:21:03,082 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 20:21:03,082 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:21:03,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-11-15 20:21:03,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:21:03,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:21:03,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:21:03,084 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:21:03,084 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:21:03,085 INFO L791 eck$LassoCheckResult]: Stem: 567#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 563#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 564#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 559#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 560#L521 assume !build_fullname_#t~short10; 565#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;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; 568#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; 562#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;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; 551#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 552#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 556#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 557#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 558#L514-2 [2019-11-15 20:21:03,086 INFO L793 eck$LassoCheckResult]: Loop: 558#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 554#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); 555#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; 558#L514-2 [2019-11-15 20:21:03,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:21:03,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1849486153, now seen corresponding path program 1 times [2019-11-15 20:21:03,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:21:03,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411487180] [2019-11-15 20:21:03,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:03,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:03,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:21:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:21:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:21:03,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411487180] [2019-11-15 20:21:03,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:21:03,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:21:03,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298200576] [2019-11-15 20:21:03,166 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:21:03,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:21:03,167 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 1 times [2019-11-15 20:21:03,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:21:03,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294863082] [2019-11-15 20:21:03,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:03,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:03,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:21:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:03,174 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:21:03,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:21:03,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:21:03,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:21:03,222 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-15 20:21:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:21:03,304 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-11-15 20:21:03,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:21:03,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-11-15 20:21:03,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:21:03,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2019-11-15 20:21:03,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 20:21:03,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 20:21:03,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-11-15 20:21:03,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:21:03,308 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 20:21:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-11-15 20:21:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-15 20:21:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 20:21:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-15 20:21:03,311 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-15 20:21:03,312 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-15 20:21:03,312 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:21:03,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2019-11-15 20:21:03,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:21:03,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:21:03,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:21:03,314 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:21:03,314 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:21:03,314 INFO L791 eck$LassoCheckResult]: Stem: 622#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 617#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 618#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 613#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 614#L521 assume !build_fullname_#t~short10; 619#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;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; 624#L523 assume build_fullname_#t~short14; 616#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;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; 623#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 607#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 610#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 611#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 612#L514-2 [2019-11-15 20:21:03,315 INFO L793 eck$LassoCheckResult]: Loop: 612#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 608#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); 609#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; 612#L514-2 [2019-11-15 20:21:03,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:21:03,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1906744455, now seen corresponding path program 1 times [2019-11-15 20:21:03,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:21:03,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517697602] [2019-11-15 20:21:03,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:03,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:03,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:21:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:03,356 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:21:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:21:03,357 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 2 times [2019-11-15 20:21:03,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:21:03,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499553280] [2019-11-15 20:21:03,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:03,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:03,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:21:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:03,365 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:21:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:21:03,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1413453764, now seen corresponding path program 1 times [2019-11-15 20:21:03,366 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:21:03,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982549647] [2019-11-15 20:21:03,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:03,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:03,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:21:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:21:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:21:03,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982549647] [2019-11-15 20:21:03,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:21:03,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:21:03,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183362221] [2019-11-15 20:21:03,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:21:03,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:21:03,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:21:03,476 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-15 20:21:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:21:03,581 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-11-15 20:21:03,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:21:03,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-11-15 20:21:03,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:21:03,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 25 transitions. [2019-11-15 20:21:03,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 20:21:03,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 20:21:03,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-11-15 20:21:03,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:21:03,585 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 20:21:03,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-11-15 20:21:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2019-11-15 20:21:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 20:21:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-15 20:21:03,587 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-15 20:21:03,587 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-15 20:21:03,587 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:21:03,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2019-11-15 20:21:03,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:21:03,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:21:03,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:21:03,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:21:03,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:21:03,590 INFO L791 eck$LassoCheckResult]: Stem: 685#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 681#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 682#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 677#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 678#L521 assume !build_fullname_#t~short10; 683#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;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; 686#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; 680#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;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; 668#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 669#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 670#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 671#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 674#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 675#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 676#L514-2 [2019-11-15 20:21:03,590 INFO L793 eck$LassoCheckResult]: Loop: 676#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 672#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); 673#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; 676#L514-2 [2019-11-15 20:21:03,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:21:03,590 INFO L82 PathProgramCache]: Analyzing trace with hash 761840220, now seen corresponding path program 1 times [2019-11-15 20:21:03,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:21:03,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15849884] [2019-11-15 20:21:03,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:03,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:03,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:21:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:21:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:21:03,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15849884] [2019-11-15 20:21:03,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558744097] [2019-11-15 20:21:03,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4a39ebc7-80d4-4b3f-a65d-0df5e5dbe14b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:21:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:21:03,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 64 conjunts are in the unsatisfiable core [2019-11-15 20:21:03,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:21:03,880 INFO L341 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-15 20:21:03,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 21 [2019-11-15 20:21:03,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:21:03,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:21:03,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 20:21:03,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:27 [2019-11-15 20:21:04,125 INFO L341 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2019-11-15 20:21:04,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 48 [2019-11-15 20:21:04,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:21:04,147 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-15 20:21:04,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:21:04,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-11-15 20:21:04,242 INFO L341 Elim1Store]: treesize reduction 14, result has 67.4 percent of original size [2019-11-15 20:21:04,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 42 [2019-11-15 20:21:04,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:21:04,261 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-15 20:21:04,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:21:04,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:4 [2019-11-15 20:21:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:21:04,265 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:21:04,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-15 20:21:04,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899628922] [2019-11-15 20:21:04,266 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:21:04,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:21:04,267 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 3 times [2019-11-15 20:21:04,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:21:04,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222502782] [2019-11-15 20:21:04,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:04,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:04,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:21:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:04,280 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:21:04,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:21:04,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 20:21:04,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:21:04,324 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 11 states. [2019-11-15 20:21:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:21:05,172 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-11-15 20:21:05,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:21:05,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2019-11-15 20:21:05,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:21:05,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 28 transitions. [2019-11-15 20:21:05,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 20:21:05,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 20:21:05,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2019-11-15 20:21:05,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:21:05,175 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-15 20:21:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2019-11-15 20:21:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-11-15 20:21:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 20:21:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-11-15 20:21:05,178 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-15 20:21:05,178 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-15 20:21:05,178 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:21:05,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2019-11-15 20:21:05,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:21:05,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:21:05,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:21:05,179 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:21:05,179 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:21:05,180 INFO L791 eck$LassoCheckResult]: Stem: 791#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 787#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 788#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 783#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 784#L521 assume !build_fullname_#t~short10; 789#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;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; 797#L523 assume build_fullname_#t~short14; 786#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;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; 775#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 776#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 792#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 793#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 780#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 781#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 782#L514-2 [2019-11-15 20:21:05,180 INFO L793 eck$LassoCheckResult]: Loop: 782#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 778#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); 779#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; 782#L514-2 [2019-11-15 20:21:05,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:21:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1571186846, now seen corresponding path program 1 times [2019-11-15 20:21:05,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:21:05,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137079184] [2019-11-15 20:21:05,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:05,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:05,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:21:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:05,252 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:21:05,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:21:05,255 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 4 times [2019-11-15 20:21:05,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:21:05,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622435357] [2019-11-15 20:21:05,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:05,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:05,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:21:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:05,263 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:21:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:21:05,264 INFO L82 PathProgramCache]: Analyzing trace with hash 673793151, now seen corresponding path program 1 times [2019-11-15 20:21:05,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:21:05,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970262673] [2019-11-15 20:21:05,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:05,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:21:05,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:21:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:21:05,343 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:21:07,434 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 273 DAG size of output: 230 [2019-11-15 20:21:09,178 WARN L191 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 182 DAG size of output: 174 [2019-11-15 20:21:09,184 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:21:09,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:21:09,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:21:09,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:21:09,184 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:21:09,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:21:09,184 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:21:09,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:21:09,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname.i_Iteration7_Lasso [2019-11-15 20:21:09,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:21:09,184 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:21:09,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:09,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:21:10,313 WARN L191 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 146 [2019-11-15 20:21:10,859 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-11-15 20:21:11,066 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-15 20:21:11,315 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 20:21:13,480 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-11-15 20:21:13,503 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:21:13,503 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:21:13,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,505 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,505 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,505 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,505 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,506 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,506 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,507 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,508 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,508 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,508 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,508 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,508 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,508 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,510 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,511 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,511 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,512 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,512 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,513 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,513 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,513 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,513 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,515 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,515 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,515 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,515 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,516 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,516 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,517 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,517 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,517 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,518 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,518 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,518 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,518 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,520 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,520 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,520 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,521 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,522 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,522 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,523 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,523 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,523 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,524 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,525 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,525 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,525 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,527 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,527 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,528 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,528 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,529 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,530 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,530 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,530 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,531 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,532 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,533 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:21:13,533 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:21:13,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,536 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,536 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,537 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,537 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,538 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,539 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,539 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,541 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,541 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,541 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,541 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,541 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,543 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,543 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,543 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,543 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,544 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,544 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,545 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,546 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,547 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,547 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,548 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,548 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,549 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,549 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,551 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,552 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,552 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,552 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,552 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,554 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,554 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,554 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,555 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,555 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,555 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,557 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,557 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,557 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,557 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,558 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,558 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,559 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,560 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,560 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,560 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,560 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,561 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,561 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,562 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,562 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,563 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,563 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,563 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,563 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,564 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,565 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,566 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,568 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,568 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,569 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,569 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,570 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,571 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,571 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,571 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,572 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:21:13,572 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:21:13,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,574 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,574 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,575 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,575 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,577 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,577 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,578 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,578 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,578 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,580 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,580 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,581 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,581 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,583 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,583 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,584 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,585 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,586 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,586 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,586 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,586 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,588 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,589 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,592 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:21:13,592 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:21:13,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,596 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:21:13,597 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:21:13,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,601 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,602 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,602 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,602 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:21:13,602 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:21:13,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,605 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,605 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:21:13,605 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,605 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,605 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,606 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:21:13,606 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:21:13,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,608 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,608 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,609 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:21:13,609 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:21:13,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,612 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,612 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,612 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,613 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:21:13,613 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:21:13,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:21:13,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:21:13,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:21:13,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:21:13,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:21:13,616 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:21:13,620 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:21:13,620 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:21:13,655 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:21:13,698 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 20:21:13,698 INFO L444 ModelExtractionUtils]: 81 out of 88 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 20:21:13,699 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:21:13,699 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:21:13,700 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:21:13,700 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strchr_~t.offset, v_rep(select #length ULTIMATE.start_strchr_~t.base)_1) = -1*ULTIMATE.start_strchr_~t.offset + 1*v_rep(select #length ULTIMATE.start_strchr_~t.base)_1 Supporting invariants [] [2019-11-15 20:21:13,902 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-11-15 20:21:13,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:21:13,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:21:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:21:13,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:21:13,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:21:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:21:13,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:21:13,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:21:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:21:13,982 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 [2019-11-15 20:21:13,982 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 20:21:13,998 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 26 states and 30 transitions. Complement of second has 4 states. [2019-11-15 20:21:13,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 20:21:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:21:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 20:21:13,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 20:21:13,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:21:13,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-15 20:21:14,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:21:14,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 20:21:14,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:21:14,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2019-11-15 20:21:14,001 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:21:14,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-11-15 20:21:14,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:21:14,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:21:14,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:21:14,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:21:14,001 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:21:14,001 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:21:14,001 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:21:14,001 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:21:14,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:21:14,002 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:21:14,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:21:14,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:21:14 BoogieIcfgContainer [2019-11-15 20:21:14,009 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:21:14,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:21:14,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:21:14,009 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:21:14,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:20:49" (3/4) ... [2019-11-15 20:21:14,015 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:21:14,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:21:14,016 INFO L168 Benchmark]: Toolchain (without parser) took 25441.85 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 511.2 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 346.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:21:14,017 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:21:14,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 530.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:21:14,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:21:14,019 INFO L168 Benchmark]: Boogie Preprocessor took 67.26 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:21:14,020 INFO L168 Benchmark]: RCFGBuilder took 483.30 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: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:21:14,020 INFO L168 Benchmark]: BuchiAutomizer took 24293.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 359.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.5 MB). Peak memory consumption was 346.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:21:14,021 INFO L168 Benchmark]: Witness Printer took 5.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:21:14,024 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 530.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.26 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 483.30 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: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24293.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 359.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.5 MB). Peak memory consumption was 346.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 * s1 + unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] and consists of 4 locations. One deterministic module has affine ranking function -1 * t + unknown-#length-unknown[t] and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 22.4s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 119 SDtfs, 102 SDslu, 163 SDs, 0 SdLazy, 206 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital474 mio100 ax100 hnf99 lsp98 ukn65 mio100 lsp44 div100 bol100 ite100 ukn100 eq203 hnf85 smp98 dnf457 smp97 tf100 neg97 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 149ms VariablesStem: 19 VariablesLoop: 10 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...